Increasing index sizes for information set decoding algorithms

DOI10.1007/978-3-031-90229-1_5MaRDI QIDQ6888973zbMATH OpenFDO

Authors Zachary Welch

Publication date 5 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-90229-1_5

zbMATH Keywords

code-based cryptographyinformation set decodingrow reductionStern's algorithm

Mathematics Subject Classification ID

Information theory (general) (94A15) Cryptography (94A60) Decoding (94B35)

Cites work

• A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
• Attacking and Defending the McEliece Cryptosystem
• Decoding linear codes with high error rate and its impact for LPN security
• 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})\)
• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
• Memory-efficient quantum information set decoding algorithm
• On computing nearest neighbors with applications to decoding of binary linear codes
• On the inherent intractability of certain coding problems (Corresp.)
• Security bounds for the design of code-based cryptosystems
• Smaller decoding exponents: ball-collision decoding
• Two decoding algorithms for linear codes

This page was built for publication: Increasing index sizes for information set decoding algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6888973)