Elsevier

Journal of Algorithms

Volume 12, Issue 3, September 1991, Pages 464-481
Journal of Algorithms

Generalized riemann hypothesis and factoring polynomials over finite fields

https://doi.org/10.1016/0196-6774(91)90014-PGet rights and content

Abstract

It is shown that, assuming the generalized Riemann hypothesis, there exists a deterministic polynomial time algorithm, which on input of a rational prime p and a monic integral polynomial f, whose discriminant is not divisible by p and whose roots generate an Abelian extension over Q, computes all the irreducible factors of f mod p in Fp[x].

References (21)

  • L Ronyai

    Factoring polynomials over finite fields

    J. Algorithms

    (1988)
  • L.M Adleman et al.

    Finding irreducible polynomials over finite fields

  • L.M Adleman et al.

    On taking roots in finite fields

  • L.M Adleman et al.

    On distinguishing prime numbers from composite numbers

    Ann. of Math.

    (1983)
  • A.V Aho et al.

    The Design and Analysis of Computer Algorithms

    (1974)
  • N.C Ankeny

    The least quadratic non residue

    Ann. of Math.

    (1952)
  • E Artin et al.

    Class Field Theory

    (1967)
  • E Bach

    Fast algorithms under the extended Riemann hypothesis: A concrete estimate

  • E.R Berlekamp

    Factoring polynomials over large finite fields

    Math. Comp.

    (1970)
  • E.R Berlekamp

    Algebraic Coding Theory

    (1968)
There are more references available in the full text version of this article.

Cited by (0)

A preliminary version of this paper appeared in [H2].

Research supported by NSF through Grant CCR 8701541.

View full text