Revisiting nearest-neighbor-based information set decoding
From MaRDI portal
Recommendations
- Analysis of information set decoding for a sub-linear error weight
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
- Improved information set decoding for code-based cryptosystems with constrained memory
- On computing nearest neighbors with applications to decoding of binary linear codes
- Improved quantum information set decoding
Cites work
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- Analysis of information set decoding for a sub-linear error weight
- 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 3133919 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 7799598 (Why is no real title available?)
- Improved classical and quantum algorithms for subset-sum
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
- New time-memory trade-offs for subset sum -- improving ISD in theory and practice
- On computing nearest neighbors with applications to decoding of binary linear codes
- Smaller decoding exponents: ball-collision decoding
- Statistical decoding 2.0: reducing decoding to LPN
- Syndrome Decoding Estimator
Cited in
(3)
This page was built for publication: Revisiting nearest-neighbor-based information set decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595933)
