The quantum decoding problem
From MaRDI portal
Cites work
- A Mathematical Theory of Communication
- Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
- Collision resistant hashing from sub-exponential learning parity with noise
- 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})\)
- Efficient public key encryption based on ideal lattices (extended abstract)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- Low-complexity cryptographic hash functions
- New Algorithms for Learning in Presence of Errors
- On computing nearest neighbors with applications to decoding of binary linear codes
- On lattices, learning with errors, random linear codes, and cryptography
- On the distinguishability of random quantum states
- Property testing and its connection to learning and approximation
- Quantum algorithms for variants of average-case lattice problems via filtering
- Quantum information set decoding algorithms
- Quantum reduction of finding short code vectors to the decoding problem
- Reversing quantum dynamics with near-optimal quantum and classical fidelity
- Statistical decoding 2.0: reducing decoding to LPN
- Two decoding algorithms for linear codes
- Verifiable quantum advantage without structure
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
This page was built for publication: The quantum decoding problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859967)
