preprint
Open access
Breaking DLP in $GF(p^5)$ using 3-dimensional sieving
Research footprint
At a glance
- Citations
- 1
- References
- 0
- Comments
- 0
Paper overview
Abstract
We report on a discrete logarithm computation in $GF(p^5)$ for a 20-decimal digit prime, using the number field sieve algorithm (NFS-DL), and a relation collection phase over degree-two polynomials, instead of the more classical degree-one case.
Record transparency
Publication details
- OpenAlex
- W2755921894
- Document type
- preprint
- Language
- EN
- Source
- HAL (Le Centre pour la Communication Scientifique Directe)
- Last metadata update
Comments
Log in to join the discussion.