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

Laurent Grémy; Aurore Guillevic; François Morain

Preprints, Working Papers, ...

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

Laurent Grémy ¹ Aurore Guillevic ¹ François Morain ^{2, 3}

1 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms

LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry, Inria Nancy - Grand Est

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, ...

Domain :

Computer Science [cs] / Cryptography and Security [cs.CR]

Mathematics [math] / Number Theory [math.NT]

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 : Friday, October 9, 2020 - 2:40:04 PM

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

File

Identifiers

Collections

Citation

Export

Metrics

701

141

Contact Legal Notice Personal Data

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

File

Identifiers

Collections

Citation

Export

Share

Metrics

701

141

Contact Legal Notice Personal Data