Classical and Quantum 3 and 4-Sieves to Solve SVP with Low Memory

DOI10.1007/978-3-031-40003-2_9MaRDI QIDQ6493388

Unnamed Author, André Chailloux

Publication date: 26 April 2024

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Speed-ups and time-memory trade-offs for tuple lattice sieving
• Quantum algorithms for the approximate \(k\)-list problem and their application to lattice sieving
• Tuple lattice sieving
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• Sieve algorithms for the shortest vector problem are practical
• On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
• New directions in nearest neighbor searching with applications to lattice sieving
• Improved Algorithms for the Approximate k-List Problem in Euclidean Norm
• Lattice Sieving via Quantum Random Walks

This page was built for publication: Classical and Quantum 3 and 4-Sieves to Solve SVP with Low Memory