Skip to Main content Skip to Navigation
Conference papers

Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields

Abstract : We study the discrete logarithm problem at the boundary case between small and medium characteristic finite fields, which is precisely the area where finite fields used in pairing-based cryptosystems live. In order to evaluate the security of pairing-based protocols, we thoroughly analyze the complexity of all the algorithms that coexist at this boundary case: the Quasi-Polynomial algorithms, the Number Field Sieve and its many variants, and the Function Field Sieve. We adapt the latter to the particular case where the extension degree is composite, and show how to lower the complexity by working in a shifted function field. All this study finally allows us to give precise values for the characteristic asymptotically achieving the highest security level for pairings. Surprisingly enough, there exist special characteristics that are as secure as general ones.
Document type :
Conference papers
Complete list of metadatas

Cited literature [48 references]  Display  Hide  Download
Contributor : Cécile Pierrot <>
Submitted on : Wednesday, June 17, 2020 - 12:05:18 PM
Last modification on : Saturday, July 18, 2020 - 3:12:21 AM


Files produced by the author(s)


  • HAL Id : hal-02871839, version 1



Gabrielle de Micheli, Pierrick Gaudry, Cécile Pierrot. Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields. CRYPTO2020, Aug 2020, Santa Barbara, United States. ⟨hal-02871839⟩



Record views


Files downloads