Skip to Main content Skip to Navigation

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
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
3 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 metadatas

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 : Thursday, March 5, 2020 - 6:35:13 PM

File

Vignette du document
p5dd20hd.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01568373, version 1

Collections

CNRS | X | LIX | INSMI | UNIV-LORRAINE | X-LIX | LORIA | LORIA-ALGO | INRIA | UNIV-PARIS-SACLAY | X-DEP-INFO

Citation

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

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

607

Files downloads

114

 

Contact                    Legal Notice                    Personal Data