# Improving NFS for the discrete logarithm problem in non-prime finite fields

3 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : The aim of this work is to investigate the hardness of the discrete logarithm problem in fields GF($p^n$) where $n$ is a small integer greater than $1$. Though less studied than the small characteristic case or the prime field case, the difficulty of this problem is at the heart of security valuations for torus-based and pairing-based cryptography. The best known method for solving this problem is the Number Field Sieve (NFS). A key ingredient in this algorithm is the ability to find good polynomials that define the extension fields used in NFS. We design two new methods for this task, modifying the asymptotic complexity and paving the way for record-breaking computations. We exemplify these results with the computation of discrete logarithms over a field GF($p^2$) whose cardinality is 180 digits (595 bits) long.
Keywords :
Type de document :
Communication dans un congrès
Marc Fischlin and Elisabeth Oswald. Eurocrypt 2015, Apr 2015, Sofia, Bulgaria. Eurocrypt 2015, 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lecture Notes in Computer Sciences, pp.27, 2015, Eurocrypt 2015, 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques. 〈https://www.cosic.esat.kuleuven.be/eurocrypt_2015〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01112879
Contributeur : Aurore Guillevic <>
Soumis le : mardi 3 février 2015 - 18:02:40
Dernière modification le : jeudi 11 janvier 2018 - 06:23:16
Document(s) archivé(s) le : mercredi 27 mai 2015 - 16:36:48

### Fichier

euro15.pdf
Fichiers produits par l'(les) auteur(s)

### Identifiants

• HAL Id : hal-01112879, version 1

### Citation

Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain. Improving NFS for the discrete logarithm problem in non-prime finite fields. Marc Fischlin and Elisabeth Oswald. Eurocrypt 2015, Apr 2015, Sofia, Bulgaria. Eurocrypt 2015, 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lecture Notes in Computer Sciences, pp.27, 2015, Eurocrypt 2015, 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques. 〈https://www.cosic.esat.kuleuven.be/eurocrypt_2015〉. 〈hal-01112879v1〉

### Métriques

Consultations de la notice

## 532

Téléchargements de fichiers