Generalized riemann hypothesis and factoring polynomials over finite fields☆
References (21)
Factoring polynomials over finite fields
J. Algorithms
(1988)- et al.
Finding irreducible polynomials over finite fields
- et al.
On taking roots in finite fields
- et al.
On distinguishing prime numbers from composite numbers
Ann. of Math.
(1983) - et al.
The Design and Analysis of Computer Algorithms
(1974) The least quadratic non residue
Ann. of Math.
(1952)- et al.
Class Field Theory
(1967) Fast algorithms under the extended Riemann hypothesis: A concrete estimate
Factoring polynomials over large finite fields
Math. Comp.
(1970)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.
Copyright © 1991 Published by Elsevier Inc.