Welcome to the resource topic for 2020/329
Title:
Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
Authors: Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot
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.
ePrint: https://eprint.iacr.org/2020/329
Talk: https://www.youtube.com/watch?v=O6MLghPbf8Y
Slides: https://iacr.org/submit/files/slides/2020/crypto/crypto2020/78/slides.pdf
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .