Estimates of implementation complexity for quantum cryptanalysis of post-quantum lattice-based cryptosystems
From MaRDI portal
Cites work
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- A method for obtaining digital signatures and public-key cryptosystems
- Applying Grover's algorithm to AES: quantum resource estimates
- Estimating quantum speedups for lattice sieves
- Faster exponential time algorithms for the shortest vector problem
- Finding shortest lattice vectors faster using quantum search
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- Implementing Grover oracles for quantum key search on AES and LowMC
- Inapproximability of the shortest vector problem: toward a deterministic reduction
- Introduction to post-quantum cryptography
- New directions in cryptography
- New directions in nearest neighbor searching with applications to lattice sieving
- Parallel quantum computation and quantum codes
- Quantum circuit implementations of AES with fewer qubits
- Quantum computation and quantum information. 10th anniversary edition
- Sieve algorithms for the shortest vector problem are practical
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Solving the shortest vector problem in 2ⁿ time using discrete Gaussian sampling (extended abstract)
- Tuple lattice sieving
Cited in
(1)
This page was built for publication: Estimates of implementation complexity for quantum cryptanalysis of post-quantum lattice-based cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644067)
