Memory-efficient quantum information set decoding algorithm
From MaRDI portal
Publication:6535497
Cites work
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- 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})\)
- Grover vs. McEliece
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 4070796 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- Hybrid decoding -- classical-quantum trade-offs for information set decoding
- Improved quantum information set decoding
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
- On computing nearest neighbors with applications to decoding of binary linear codes
- Quantum information set decoding algorithms
- Search via Quantum Walk
- Security bounds for the design of code-based cryptosystems
- Statistical decoding 2.0: reducing decoding to LPN
- Syndrome Decoding Estimator
Cited in
(2)
This page was built for publication: Memory-efficient quantum information set decoding algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535497)
