Constructing nonresidues in finite fields and the extended Riemann hypothesis

DOI10.1090/S0025-5718-96-00751-XMaRDI QIDQ4889937zbMATH OpenOpenAlexFDO

Authors Victor Shoup, Johannes Buchmann

Publication date 3 December 1996

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/s0025-5718-96-00751-x

zbMATH Keywords

algorithmextended Riemann hypothesisfactoring polynomialsconstructing primitive rootsnonresidues in finite fields

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Searching for Primitive Roots in Finite Fields
• Generalized riemann hypothesis and factoring polynomials over finite fields
• Factoring polynomials over finite fields
• Irreducibility and deterministic \(r\)-th root finding over finite fields

Cites work

• scientific article; zbMATH DE number 3167868 (Why is no real title available?)
• scientific article; zbMATH DE number 3480719 (Why is no real title available?)
• Algorithms in Algebraic Number Theory
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Explicit Bounds for Primality Testing and Related Problems
• Factoring polynomials and primitive elements for special primes
• Factoring polynomials over finite fields
• Factoring with Cyclotomic Polynomials
• Factorization of solvable polynomials over finite fields and the generalized Riemann hypothesis
• Finding Isomorphisms Between Finite Fields
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• On principal ideal testing in algebraic number fields
• On the computation of units and class numbers by a generalization of Lagrange's algorithm
• On the period length of the generalized Lagrange algorithm
• Searching for Primitive Roots in Finite Fields
• Smoothness and factoring polynomials over finite fields
• The distribution of primitive roots in finite fields
• The least quadratic non residue

Cited in

(6)

• Using number fields to compute logarithms in finite fields
• On taking square roots without quadratic nonresidues over finite fields. With an Appendix by Lawrence C. Washington
• Irreducibility and deterministic \(r\)-th root finding over finite fields
• Algorithms in Algebraic Number Theory
• scientific article; zbMATH DE number 6124436 (Why is no real title available?)
• Non-standard finite fields over \(I\Delta_0+\Omega_1\)

This page was built for publication: Constructing nonresidues in finite fields and the extended Riemann hypothesis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4889937)