McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
From MaRDI portal
Publication:2170098
DOI10.1007/978-3-031-07082-2_16zbMath1497.94086OpenAlexW4285227183MaRDI QIDQ2170098
Alexander May, Andre Esser, Floyd Zweydinger
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-07082-2_16
Linear codes (general theory) (94B05) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (4)
New time-memory trade-offs for subset sum -- improving ISD in theory and practice ⋮ Breaking Goppa-based McEliece with hints ⋮ Decoding McEliece with a hint -- secret Goppa key parts reveal everything ⋮ Exploring decryption failures of BIKE: new class of weak keys and key recovery attacks
Uses Software
Cites Work
- Unnamed Item
- On the concrete hardness of learning with errors
- Decoding linear codes with high error rate and its impact for LPN security
- Gaussian elimination is not optimal
- Analysis of Information Set Decoding for a Sub-linear Error Weight
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- 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
- Attacking and Defending the McEliece Cryptosystem
- New Generic Algorithms for Hard Knapsacks
- Information-Set Decoding for Linear Codes over F q
- Factorization of a 768-Bit RSA Modulus
This page was built for publication: McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
