We consider the problem of factoring polynomials over GF(p) for those prime numbers p for which all prime factors of p- 1 are small. We show that if we have a primitive t-th root of unity for every prime t dividing p- 1 then factoring polynomials over GF(p) can be done in deterministic polynomial time.
- AMS subject classification (1980): 11Y16, 68Q25, 68Q40
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics