On finding primitive roots in finite fields

DOI10.1016/0304-3975(95)00164-6zbMath0871.11091MaRDI 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 field; primitive root

Mathematics Subject Classification ID

11Y16: Number-theoretic algorithms; complexity

11T30: Structure theory for finite fields and commutative rings (number-theoretic aspects)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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