Faster individual discrete logarithms in finite fields of composite extension degree - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Mathematics of Computation Year : 2019

Faster individual discrete logarithms in finite fields of composite extension degree

Abstract

Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., {GF}$(p^2)$, {GF}$(p^{12})$) are the Number Field Sieve and its variants (special, high-degree, tower). The best algorithms in small characteristic finite fields (e.g., {GF}$(3^{6 \cdot 509})$) are the Function Field Sieve, Joux's algorithm, and the quasipolynomial-time algorithm. The last step of this family of algorithms is the individual logarithm computation. It computes a smooth decomposition of a given target in two phases: an initial splitting, then a descent tree. While new improvements have been made to reduce the complexity of the dominating relation collection and linear algebra steps, resulting in a smaller factor basis (database of known logarithms of small elements), the last step remains at the same level of difficulty. Indeed, we have to find a smooth decomposition of a typically large element in the finite field. This work improves the initial splitting phase and applies to any nonprime finite field. It is very efficient when the extension degree is composite. It exploits the proper subfields, resulting in a much more smooth decomposition of the target. This leads to a new trade-off between the initial splitting step and the descent step in small characteristic. Moreover it reduces the width and the height of the subsequent descent tree.
Fichier principal
Vignette du fichier
18_Guillevic_IndLog.pdf (420.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01341849 , version 1 (05-07-2016)
hal-01341849 , version 2 (06-08-2017)
hal-01341849 , version 3 (17-09-2018)

Identifiers

Cite

Aurore Guillevic. Faster individual discrete logarithms in finite fields of composite extension degree. Mathematics of Computation, 2019, 88 (317), pp.1273-1301. ⟨10.1090/mcom/3376⟩. ⟨hal-01341849v3⟩

Relations

544 View
482 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More