Breaking DLP in $GF(p^5)$ using 3-dimensional sieving - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2017

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


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.
Fichier principal
Vignette du fichier
p5dd20hd.pdf (366.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01568373 , version 1 (25-07-2017)


  • 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⟩
503 View
138 Download


Gmail Facebook X LinkedIn More