On finding primitive roots in finite fields

DOI10.1016/0304-3975(95)00164-6zbMath0871.11091OpenAlexW2034013822MaRDI QIDQ1351512

Igor E. Shparlinski

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00164-6

zbMATH Keywords

finite fieldprimitive root

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)

Related Items (15)

Character sums, primitive elements, and powers in finite fields ⋮ A multimodular algorithm for computing Bernoulli numbers ⋮ On the complexity of integer matrix multiplication ⋮ Even faster integer multiplication ⋮ Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) ⋮ Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields ⋮ Algebraic algorithms for variants of subset sum ⋮ Deterministically generating Picard groups of hyperelliptic curves over finite fields ⋮ Comments on search procedures for primitive roots ⋮ Faster integer multiplication using plain vanilla FFT primes ⋮ Discrete logarithm problems with auxiliary inputs ⋮ Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields ⋮ Companion Matrix and Recognition of Primitive Polynomial ⋮ On the construction of finite field elements of large order ⋮ New and explicit constructions of unbalanced Ramanujan bipartite graphs

Cites Work

• Finding irreducible and primitive polynomials
• On Character Sums and Primitive Roots^†
• The distribution of primitive roots in finite fields
• Finding Isomorphisms Between Finite Fields
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• Searching for Primitive Roots in Finite Fields
• ON THE PROBLEM OF JACOBSTHAL
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On finding primitive roots in finite fields