Revisiting nearest-neighbor-based information set decoding

DOI10.1007/978-3-031-47818-5_3MaRDI QIDQ6595933

Andre Esser

Publication date: 30 August 2024

zbMATH Keywords

code-based cryptographynearest neighbor searchsyndrome decodingrepresentation technique

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Decoding (94B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decoding linear codes with high error rate and its impact for LPN security
• McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
• Improved classical and quantum algorithms for subset-sum
• 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})$
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• Syndrome Decoding Estimator
• Smaller Decoding Exponents: Ball-Collision Decoding
• New time-memory trade-offs for subset sum -- improving ISD in theory and practice
• Statistical decoding 2.0: reducing decoding to LPN

Related Items (2)

Asymptotics and improvements of sieving for codes ⋮ Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks

This page was built for publication: Revisiting nearest-neighbor-based information set decoding