Generating sets for the multiplicative groups of algebras over finite fields and expander graphs
From MaRDI portal
Publication:2409015
Recommendations
Cites work
- A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
- Algebraic Cayley graphs over finite fields
- An Estimate for Character Sums
- Better expanders and superconcentrators
- Cayley graphs generated by small degree polynomials over finite fields
- Constructing Small Generating Sets for the Multiplicative Groups of Algebras over Finite Fields
- Diameters and Eigenvalues
- Elements of provable high orders in finite fields
- Expander graphs and their applications
- Function field sieve method for discrete logarithms over finite fields
- Generators and irreducible polynomials over finite fields
- Handbook of finite fields
- On Orders of Optimal Normal Basis Generators
- On primitive elements in finite fields of low characteristic
- On the function field sieve and the impact of higher splitting probabilities. Application to discrete logarithms in \(\mathbb{F}_{2^{1971}}\) and \(\mathbb{F}_{2^{3164}}\)
- Orders of Gauss periods in finite fields
- Primitive points on constant elliptic curves over function fields
- Ramanujan graphs
- Searching for Primitive Roots in Finite Fields
- Several generalizations of Weil sums
- The PCP theorem by gap amplification
Cited in
(2)
This page was built for publication: Generating sets for the multiplicative groups of algebras over finite fields and expander graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409015)