Searching for Primitive Roots in Finite Fields

From MaRDI portal
Publication:3987942

DOI10.2307/2153041zbMath0747.11060OpenAlexW4236247848WikidataQ56139168 ScholiaQ56139168MaRDI QIDQ3987942

Victor Shoup

Publication date: 28 June 1992

Full work available at URL: https://doi.org/10.2307/2153041



Related Items

Local Reductions, Deterministic root finding over finite fields using Graeffe transforms, On the least square-free primitive root modulo \(p\), Local reduction, On some approximation problems concerning sparse polynomials over finite fields, On finding primitive roots in finite fields, Polynomial Multiplication over Finite Fields in Time \( O(n \log n \), Factor base discrete logarithms in Kummer extensions, An elliptic curve analogue of Pillai’s lower bound on primitive roots, Generating sets for the multiplicative groups of algebras over finite fields and expander graphs, Univariate polynomial factorization over finite fields, Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets, Computing sparse multiples of polynomials, Abelian lifts of polynomials, On the least primitive root in number fields, Factorization, malleability and equivalent problems, Efficient Finite Fields in the Maxima Computer Algebra System, ON THE MINIMAL NUMBER OF SMALL ELEMENTS GENERATING FINITE PRIME FIELDS, Generators and irreducible polynomials over finite fields, Cryptographic hash functions from sequences of lifted Paley graphs, Constructing nonresidues in finite fields and the extended Riemann hypothesis, Distinguishing eigenforms modulo a prime ideal, On primitive elements in finite fields of low characteristic, Square-full primitive roots, Comments on search procedures for primitive roots, Resolving Grosswald's conjecture on GRH, Counting curves and their projections, Explicit Burgess bound for composite moduli, Elements of high order in Artin-Schreier extensions of finite fields \(\mathbb{F}_q\), Special prime numbers and discrete logs in finite prime fields, Primitive Normal Polynomials Over Finite Fields, Faster polynomial multiplication over finite fields using cyclotomic coefficient rings, On the Average Distribution of Power Residues and Primitive Elements in Inversive and Nonlinear Recurring Sequences, Fast multivariate multi-point evaluation revisited, Discrete logarithm problems with auxiliary inputs, Using number fields to compute logarithms in finite fields, On the least prime primitive root, Explicit bounds for primes in residue classes, Uniform bounds for the least almost‐prime primitive root, Distributional properties of powers of matrices, On the construction of finite field elements of large order, Factorization properties of Chebyshev polynomials, Elements of large order on varieties over prime finite fields



Cites Work