Quantum sieving for code-based cryptanalysis and its limitations for ISD
From MaRDI portal
Cites work
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- A sieve algorithm for the shortest lattice vector problem
- Asymptotics and improvements of sieving for codes
- 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})\)
- Faster exponential time algorithms for the shortest vector problem
- Finding many collisions via reusable quantum walks. Application to lattice sieving
- Grover vs. McEliece
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1545673 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- Improved quantum information set decoding
- Lattice Sieving via Quantum Random Walks
- New directions in nearest neighbor searching with applications to lattice sieving
- On computing nearest neighbors with applications to decoding of binary linear codes
- On the inherent intractability of certain coding problems (Corresp.)
- Quantum algorithms for the approximate \(k\)-list problem and their application to lattice sieving
- Quantum algorithms for the subset-sum problem
- Quantum information set decoding algorithms
- Quantum Walk Algorithm for Element Distinctness
- Search via Quantum Walk
- Security bounds for the design of code-based cryptosystems
- Sieve algorithms for the shortest vector problem are practical
- Statistical decoding 2.0: reducing decoding to LPN
This page was built for publication: Quantum sieving for code-based cryptanalysis and its limitations for ISD
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956607)
