Memory-efficient quantum information set decoding algorithm
From MaRDI portal
Publication:6535497
DOI10.1007/978-3-031-35486-1_20MaRDI QIDQ6535497
Atsushi Takayasu, Naoto Kimura, Tsuyoshi Takagi
Publication date: 11 January 2024
Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decoding linear codes with high error rate and its impact for LPN security
- Improved quantum information set decoding
- Quantum information set decoding algorithms
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
- 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
- Search via Quantum Walk
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Grover vs. McEliece
- Security Bounds for the Design of Code-Based Cryptosystems
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- Syndrome Decoding Estimator
- Hybrid decoding -- classical-quantum trade-offs for information set decoding
- Statistical decoding 2.0: reducing decoding to LPN
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)
