Break DES Efficiently: Conditional Linear Cryptanalysis Under 2^42 Complexity 🔓
Discover a novel cryptanalysis method by Biham and Perle that reduces the complexity of cracking DES below 2^42, offering new insights into cipher security. Presented at FSE 2019.
IACR
1.2K views • Sep 30, 2019
About this video
Paper by Eli Biham, Stav Perle presented at Fast Software Encryption Conference 2019
See https://iacr.org/cryptodb/data/paper.php?pubkey=29240
See https://iacr.org/cryptodb/data/paper.php?pubkey=29240
Video Information
Views
1.2K
Duration
15:59
Published
Sep 30, 2019
User Reviews
3.7
(1) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now