Welcome to the resource topic for 2020/455
Title:
Cryptanalysis of LEDAcrypt
Authors: Daniel Apon, Ray Perlner, Angela Robinson, Paolo Santini
Abstract:We report on the concrete cryptanalysis of LEDAcrypt, a 2nd Round candidate in NIST’s Post-Quantum Cryptography standardization process and one of 17 encryption schemes that remain as candidates for near-term standardization. LEDAcrypt consists of a public-key encryption scheme built from the McEliece paradigm and a key-encapsulation mechanism (KEM) built from the Niederreiter paradigm, both using a quasi-cyclic low-density parity-check (QC-LDPC) code. In this work, we identify a large class of extremely weak keys and provide an algorithm to recover them. For example, we demonstrate how to recover 1 in 2^{47.72} of LEDAcrypt’s keys using only 2^{18.72} guesses at the 256-bit security level. This is a major, practical break of LEDAcrypt. Further, we demonstrate a continuum of progressively less weak keys (from extremely weak keys up to all keys) that can be recovered in substantially less work than previously known. This demonstrates that the imperfection of LEDAcrypt is fundamental to the system’s design.
ePrint: https://eprint.iacr.org/2020/455
Talk: https://www.youtube.com/watch?v=YBZNhMbWeO0
Slides: https://iacr.org/submit/files/slides/2020/crypto/crypto2020/368/slides.pdf
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .