Cryptanalysis of LEDAcrypt
From MaRDI portal
Publication:2102071
DOI10.1007/978-3-030-56877-1_14zbMath1504.94093OpenAlexW3022492499MaRDI QIDQ2102071
Daniel Apon, Ray Perlner, Angela Robinson, Paolo Maria Santíni
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56877-1_14
Related Items
A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes ⋮ Performance bounds for QC-MDPC codes decoders ⋮ Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling ⋮ Retracted: Invertible matrices over some quotient rings: identification, generation, and analysis ⋮ Invertible matrices over some quotient rings: identification, generation, and analysis ⋮ Cryptanalysis of LEDAcrypt
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
- Quantum information set decoding algorithms
- Cryptanalysis of LEDAcrypt
- Vulnerabilities of “McEliece in the World of Escher”
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Optimizing Information Set Decoding Algorithms to Attack Cyclosymmetric MDPC Codes
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Decoding One Out of Many
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
- Grover vs. McEliece
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- On the inherent intractability of certain coding problems (Corresp.)
- Smaller Decoding Exponents: Ball-Collision Decoding
This page was built for publication: Cryptanalysis of LEDAcrypt
