Pages that link to "Item:Q3987942"
From MaRDI portal
The following pages link to Searching for Primitive Roots in Finite Fields (Q3987942):
Displaying 43 items.
- Elements of large order on varieties over prime finite fields (Q262609) (← links)
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- On the least square-free primitive root modulo \(p\) (Q311449) (← links)
- Distinguishing eigenforms modulo a prime ideal (Q481399) (← links)
- On primitive elements in finite fields of low characteristic (Q491996) (← links)
- Elements of high order in Artin-Schreier extensions of finite fields \(\mathbb{F}_q\) (Q530392) (← links)
- On the least primitive root in number fields (Q625870) (← links)
- Counting curves and their projections (Q677992) (← links)
- On the least prime primitive root (Q740904) (← links)
- Factorization properties of Chebyshev polynomials (Q813193) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- On some approximation problems concerning sparse polynomials over finite fields (Q1351508) (← links)
- On finding primitive roots in finite fields (Q1351512) (← links)
- Local reduction (Q1641001) (← links)
- Factor base discrete logarithms in Kummer extensions (Q1654504) (← links)
- Resolving Grosswald's conjecture on GRH (Q1745226) (← links)
- Computing sparse multiples of polynomials (Q1934308) (← links)
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings (Q2274408) (← links)
- Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
- Generating sets for the multiplicative groups of algebras over finite fields and expander graphs (Q2409015) (← links)
- On the construction of finite field elements of large order (Q2566173) (← links)
- Abelian lifts of polynomials (Q2681249) (← links)
- Special prime numbers and discrete logs in finite prime fields (Q2759106) (← links)
- Cryptographic hash functions from sequences of lifted Paley graphs (Q2975257) (← links)
- Local Reductions (Q3448833) (← links)
- Efficient Finite Fields in the Maxima Computer Algebra System (Q3519552) (← links)
- On the Average Distribution of Power Residues and Primitive Elements in Inversive and Nonlinear Recurring Sequences (Q3600426) (← links)
- Uniform bounds for the least almost‐prime primitive root (Q4209038) (← links)
- Primitive Normal Polynomials Over Finite Fields (Q4317674) (← links)
- Generators and irreducible polynomials over finite fields (Q4340866) (← links)
- Comments on search procedures for primitive roots (Q4372647) (← links)
- Square-full primitive roots (Q4639962) (← links)
- Explicit bounds for primes in residue classes (Q4718418) (← links)
- Constructing nonresidues in finite fields and the extended Riemann hypothesis (Q4889937) (← links)
- Using number fields to compute logarithms in finite fields (Q4955874) (← links)
- Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) (Q5066949) (← links)
- An elliptic curve analogue of Pillai’s lower bound on primitive roots (Q5079426) (← links)
- Explicit Burgess bound for composite moduli (Q5157558) (← links)
- ON THE MINIMAL NUMBER OF SMALL ELEMENTS GENERATING FINITE PRIME FIELDS (Q5369393) (← links)
- Distributional properties of powers of matrices (Q5496698) (← links)
- Discrete logarithm problems with auxiliary inputs (Q5962223) (← links)
- Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets (Q6051405) (← links)
- Factorization, malleability and equivalent problems (Q6196945) (← links)
