On finding primitive roots in finite fields

DOI10.1016/0304-3975(95)00164-6MaRDI QIDQ1351512zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 429512 (Why is no real title available?)
• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 3460351 (Why is no real title available?)
• scientific article; zbMATH DE number 4185767 (Why is no real title available?)
• Finding Isomorphisms Between Finite Fields
• Finding irreducible and primitive polynomials
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• ON THE PROBLEM OF JACOBSTHAL
• On Character Sums and Primitive Roots^†
• Searching for Primitive Roots in Finite Fields
• The distribution of primitive roots in finite fields

Cited in

(19)

• Companion matrix and recognition of primitive polynomial
• Taking roots over high extensions of finite fields
• scientific article; zbMATH DE number 421665 (Why is no real title available?)
• Character sums, primitive elements, and powers in finite fields
• New and explicit constructions of unbalanced Ramanujan bipartite graphs
• Comments on search procedures for primitive roots
• On the complexity of integer matrix multiplication
• Even faster integer multiplication
• Discrete logarithm problems with auxiliary inputs
• A multimodular algorithm for computing Bernoulli numbers
• Faster integer multiplication using plain vanilla FFT primes
• Deterministically generating Picard groups of hyperelliptic curves over finite fields
• Polynomial multiplication over finite fields in time \(O(n\log n)\)
• Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields
• On Constructing Primitive Roots in Finite Fields With Advice
• On the construction of finite field elements of large order
• A complexity chasm for solving univariate sparse polynomial equations over \(p\)-adic fields
• Algebraic algorithms for variants of subset sum
• Sublinear root detection and new hardness results for sparse polynomials over finite fields

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

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