Cryptanalysis of LEDAcrypt
From MaRDI portal
Publication:2102071
DOI10.1007/978-3-030-56877-1_14zbMATH Open1504.94093OpenAlexW3022492499MaRDI QIDQ2102071FDOQ2102071
Authors: Daniel Apon, Ray Perlner, Angela Robinson, P. M. Santini 
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56877-1_14
Recommendations
- Cryptanalysis of Round-Reduced $$\mathtt{LED}$$
- Differential analysis of the LED block cipher
- Cryptanalysis of Ladder-DES
- Cryptanalysis of Ciminion
- Cryptanalysis of compact-LWE
- Cryptanalysis of the stream cipher LEX
- Cryptanalysis of LASH
- Cryptanalysis of Lee-Lee authenticated key agreement scheme
- Differential cryptanalysis of Lucifer
- scientific article; zbMATH DE number 1024056
Cites Work
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
- Title not available (Why is that?)
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
- Title not available (Why is that?)
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- Title not available (Why is that?)
- Smaller Decoding Exponents: Ball-Collision Decoding
- Title not available (Why is that?)
- On the inherent intractability of certain coding problems (Corresp.)
- Decoding One Out of Many
- Grover vs. McEliece
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Quantum information set decoding algorithms
- Cryptanalysis of LEDAcrypt
- Vulnerabilities of “McEliece in the World of Escher”
- Optimizing Information Set Decoding Algorithms to Attack Cyclosymmetric MDPC Codes
Cited In (9)
- Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling
- Cryptanalysis of Round-Reduced $$\mathtt{LED}$$
- Performance bounds for QC-MDPC codes decoders
- A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes
- Retracted: Invertible matrices over some quotient rings: identification, generation, and analysis
- Breaking the Hardness Assumption and IND-CPA Security of HQC Submitted to NIST PQC Project
- Invertible matrices over some quotient rings: identification, generation, and analysis
- Cryptanalysis of LEDAcrypt
- Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes
Uses Software
This page was built for publication: Cryptanalysis of LEDAcrypt
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102071)
