Breaking Goppa-based McEliece with hints
From MaRDI portal
Publication:6116182
DOI10.1016/j.ic.2023.105045MaRDI QIDQ6116182
Alexander May, Elena Kirshanova
Publication date: 17 July 2023
Published in: Information and Computation (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved pseudo-random generator based on the discrete logarithm problem
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Cold boot attacks on NTRU
- (In)security of ring-LWE under partial key exposure
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- Cold boot attacks on BLISS
- 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
- Wild McEliece
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Attacking and Defending the McEliece Cryptosystem
- Code-based cryptography
- On the edge-independence number and edge-covering number for regular graphs
- Weak keys in the McEliece public-key cryptosystem
- McBits Revisited
- Smaller Decoding Exponents: Ball-Collision Decoding
- A Summary of McEliece-Type Cryptosystems and their Security
- A Distinguisher for High-Rate McEliece Cryptosystems
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Partial key exposure attacks on BIKE, Rainbow and NTRU
- Partial key exposure attack on short secret exponent CRT-RSA
This page was built for publication: Breaking Goppa-based McEliece with hints
