Standard generators of finite fields and their cyclic subgroups
From MaRDI portal
Publication:2687267
DOI10.1016/j.jsc.2022.11.001OpenAlexW4287086496MaRDI QIDQ2687267
Publication date: 1 March 2023
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.02257
Computational number theory (11Yxx) Finite fields and commutative rings (number-theoretic aspects) (11Txx) Field theory and polynomials (12-XX)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lattices of compatibly embedded finite fields
- Handbook of Finite Fields
- Fast algorithms for l -adic towers over finite fields
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Standard Lattices of Compatibly Embedded Finite Fields
- Fast construction of irreducible polynomials over finite fields
This page was built for publication: Standard generators of finite fields and their cyclic subgroups