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

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, ...
Liste complète des métadonnées

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/hal-01568373
Contributor : Laurent Grémy <>
Submitted on : Tuesday, July 25, 2017 - 11:40:45 AM
Last modification on : Wednesday, April 3, 2019 - 1:23:09 AM

File

p5dd20hd.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01568373, version 1

Citation

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

Share

Metrics

Record views

542

Files downloads

90