Constructing nonresidues in finite fields and the extended Riemann hypothesis

DOI10.1090/S0025-5718-96-00751-XzbMath0855.11067OpenAlexW2063789510MaRDI QIDQ4889937

Victor Shoup, Johannes A. 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)

Related Items

Algorithms in Algebraic Number Theory ⋮ On taking square roots without quadratic nonresidues over finite fields ⋮ Using number fields to compute logarithms in finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Factorization of solvable polynomials over finite fields and the generalized Riemann hypothesis
• On principal ideal testing in algebraic number fields
• Factoring polynomials and primitive elements for special primes
• Smoothness and factoring polynomials over finite 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
• The least quadratic non residue
• Explicit Bounds for Primality Testing and Related Problems
• The distribution of primitive roots in finite fields
• Finding Isomorphisms Between Finite Fields
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• Factoring polynomials over finite fields
• Factoring with Cyclotomic Polynomials
• Searching for Primitive Roots in Finite Fields
• Algorithms in Algebraic Number Theory
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)