Factorization of polynomials over finite fields in subexponential time under GRH
We show assuming the Generalized Riemann Hypothethis that the factorization of a one-variable polynomial of degree n over an explicitly given finite field of cardinality q can be done in deterministic time (nlog n log q)O(1). Since we need the hypothesis only to take roots in finite fields in polynomial time, the result can also be formulated in the following way: a polynomial equation over a finite field can be solved “by radicals” in subexponential time.
Unable to display preview. Download preview PDF.
- 1.A.M. Adleman, H.W. Lenstra, Jr.: Finding irreducible polynomials over finite fields. Proc. 18th ACM Symp. on Theory of Computing (STOC) Berkeley (1986) 350–353Google Scholar
- 2.E.R. Berlekamp: Factoring polynomials over large finite fields. Math. Comp. 24 (1970) 713–735Google Scholar
- 3.S.A. Evdokimov: Factoring a solvable polynomial over a finite field and generalized Riemann hypothesis. Zapiski Nauchnych Seminarov LOMI 176 (1989) 104–117 (prepublication, 1986)Google Scholar
- 4.M.-D.A. Huang: Riemann hypothesis and finding roots over finite fields. Proc. 17th ACM Symp. on Theory of Computing (STOC) New-York (1985) 121–130Google Scholar
- 5.H.W. Lenstra, Jr.: Finding isomorphisms between finite fields. Math. Comp. 56 (1991) 329–347Google Scholar
- 6.L. Rónyai: Factoring polynomials over finite fields. Proc. 28th IEEE Symp. on Foundations of Computer Science (FOCS) New-York (1987) 132–137Google Scholar
- 7.I.M. Vinogradov: Basic Number Theory. Moscow (1972)Google Scholar
- 8.B.L. van der Waerden: Algebra. Berlin (1966)Google Scholar