Understanding the Complexity of Discrete Logarithm Algorithms in Pairing-Based Finite Fields 🔍
Explore the latest research on the asymptotic complexities of discrete logarithm algorithms in finite fields relevant to cryptography, presented at Crypto 2020 by De Micheli, Gaudry, and Pierrot. Dive into key insights shaping cryptographic security!
IACR
345 views • Aug 13, 2020
About this video
Paper by Gabrielle De Micheli, Pierrick Gaudry, Cecile Pierrot presented at Crypto 2020
See https://iacr.org/cryptodb/data/paper.php?pubkey=30374.
The conference program is at https://crypto.iacr.org/2020/program.php
See https://iacr.org/cryptodb/data/paper.php?pubkey=30374.
The conference program is at https://crypto.iacr.org/2020/program.php
Video Information
Views
345
Duration
22:03
Published
Aug 13, 2020