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

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download
Contributor : Aurore Guillevic <>
Submitted on : Friday, June 3, 2016 - 2:27:01 AM
Last modification on : Wednesday, April 3, 2019 - 1:23:01 AM
Long-term archiving on : Sunday, September 4, 2016 - 10:10:21 AM


Publisher files allowed on an open archive




Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain. Improving NFS for the discrete logarithm problem in non-prime finite fields. Eurocrypt 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Apr 2015, Sofia, Bulgaria. pp.129-155, ⟨10.1007/978-3-662-46800-5_6⟩. ⟨hal-01112879v2⟩



Record views


Files downloads