Algorithms of discrete logarithm in finite fields

Razvan Barbulescu 1
1 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : In this thesis we study at length the discrete logarithm problem in finite fields. In the first part, we focus on the notion of smoothness and on ECM, the fastest known smoothness test. We present an improvement to the algorithm by analyzing the Galois properties of the division polynomials. We continue by an application of ECM in the last stage of the number field sieve (NFS). In the second part, we present NFS and its related algorithm on function fields (FFS). We show how to speed up the computation of discrete logarithms in all the prime finite fields of a given bit-size by using a pre-computation. We focus later on the polynomial selection stage of FFS and show how to compare arbitrary polynomials with a unique function. We conclude the second part with an algorithm issued from the recent improvements for discrete logarithm. The key fact was to create a descent procedure which has a quasi-polynomial number of nodes, each requiring a polynomial time. This leads to a quasi-polynomial algorithm for finite fields of small characteristic.
Document type :
Liste complète des métadonnées

Cited literature [7 references]  Display  Hide  Download
Contributor : Razvan Barbulescu <>
Submitted on : Tuesday, January 7, 2014 - 5:06:27 PM
Last modification on : Tuesday, December 18, 2018 - 4:18:25 PM
Document(s) archivé(s) le : Tuesday, April 8, 2014 - 12:00:10 AM


  • HAL Id : tel-00925228, version 1


Razvan Barbulescu. Algorithms of discrete logarithm in finite fields. Cryptography and Security [cs.CR]. Université de Lorraine, 2013. English. ⟨tel-00925228⟩



Record views


Files downloads