An improved quantum algorithm for 3-tuple lattice sieving
From MaRDI portal
Cites work
- A sieve algorithm for the shortest lattice vector problem
- Classical and Quantum 3 and 4-Sieves to Solve SVP with Low Memory
- Finding many collisions via reusable quantum walks. Application to lattice sieving
- Finding shortest lattice vectors faster using quantum search
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- Improved algorithms for the approximate k-List problem in Euclidean norm
- Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding
- Lattice Sieving via Quantum Random Walks
- New directions in nearest neighbor searching with applications to lattice sieving
- Oracles with costs
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum algorithms for the approximate \(k\)-list problem and their application to lattice sieving
- Quantum approximate counting, simplified
- Quantum search with variable times
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Quantum walk algorithm for element distinctness
- Sieve algorithms for the shortest vector problem are practical
- Solving the shortest vector problem in 2ⁿ time using discrete Gaussian sampling (extended abstract)
- Speed-ups and time-memory trade-offs for tuple lattice sieving
- The general sieve kernel and new records in lattice reduction
- Tuple lattice sieving
This page was built for publication: An improved quantum algorithm for 3-tuple lattice sieving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443327)