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

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.

Domains

Cryptography and Security [cs.CR] Number Theory [math.NT]
Fichier principal
Vignette du fichier
p5dd20hd.pdf (366.69 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Laurent Grémy  : Connect in order to contact the contributor

https://inria.hal.science/hal-01568373

Submitted on : Tuesday, July 25, 2017-11:40:45 AM

Last modification on : Thursday, November 14, 2024-4:02:03 PM

Download

Dates and versions

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

Identifiers

  • HAL Id : hal-01568373 , version 1

Cite

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

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

X CNRS INRIA LIX X-LIX X-DEP-INFO UNIV-LORRAINE INRIA2 LORIA LORIA-ALGO UNIV-PARIS-SACLAY GS-COMPUTER-SCIENCE
565 View
168 Download

Share

More