Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot. Asymptotic Complexities of Discrete Logarithm Algorithms in Pairing-Relevant Finite Fields. In Daniele Micciancio, Thomas Ristenpart, editors, Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part II. Volume 12171 of Lecture Notes in Computer Science, pages 32-61, Springer, 2020. [doi]
@inproceedings{MicheliGP20-0,
title = {Asymptotic Complexities of Discrete Logarithm Algorithms in Pairing-Relevant Finite Fields},
author = {Gabrielle De Micheli and Pierrick Gaudry and Cécile Pierrot},
year = {2020},
doi = {10.1007/978-3-030-56880-1_2},
url = {https://doi.org/10.1007/978-3-030-56880-1_2},
researchr = {https://researchr.org/publication/MicheliGP20-0},
cites = {0},
citedby = {0},
pages = {32-61},
booktitle = {Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part II},
editor = {Daniele Micciancio and Thomas Ristenpart},
volume = {12171},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-56880-1},
}