240-Digit Challenge: Comparing Factorization and Discrete Logarithm Difficulties 🔐
Explore a groundbreaking experiment analyzing the complexity of factorization versus discrete logarithm for 240-digit numbers, as presented at Crypto 2020 by leading cryptographers.
IACR
634 views • Aug 13, 2020
About this video
Paper by Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann presented at Crypto 2020
See https://iacr.org/cryptodb/data/paper.php?pubkey=30365.
The conference program is at https://crypto.iacr.org/2020/program.php
See https://iacr.org/cryptodb/data/paper.php?pubkey=30365.
The conference program is at https://crypto.iacr.org/2020/program.php
Video Information
Views
634
Duration
25:08
Published
Aug 13, 2020
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.