HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Breaking DLP in $GF(p^5)$ using 3-dimensional sieving

Laurent Grémy 1 Aurore Guillevic 1 François Morain 2, 3
1 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
2 GRACE - Geometry, arithmetic, algorithms, codes and encryption
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download

Contributor : Laurent Grémy Connect in order to contact the contributor
Submitted on : Tuesday, July 25, 2017 - 11:40:45 AM
Last modification on : Wednesday, November 3, 2021 - 7:09:38 AM


Files produced by the author(s)


  • HAL Id : hal-01568373, version 1


Laurent Grémy, Aurore Guillevic, François Morain. Breaking DLP in $GF(p^5)$ using 3-dimensional sieving. 2017. ⟨hal-01568373⟩



Record views


Files downloads