International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Cécile Pierrot

Affiliation: Inria and Université de Lorraine

Publications

Year
Venue
Title
2020
CRYPTO
Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
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.
2015
EPRINT
2015
EUROCRYPT
2014
EPRINT
2014
ASIACRYPT

Program Committees

Eurocrypt 2020