Asymptotic Complexities of Discrete Logarithm Algorithms in Pairing-Relevant Finite Fields - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Gabrielle De Micheli' in GoogleThis author has not been identified. Look up 'Pierrick Gaudry' in GoogleThis author has not been identified. Look up 'Cécile Pierrot' in Google

runs on WebDSL