Tuple lattice sieving

DOI10.1112/S1461157016000292zbMATH Open1404.11140OpenAlexW2516575385MaRDI QIDQ2971007FDOQ2971007

Damien Stehlé, Thijs Laarhoven, Shi Bai

Publication date: 4 April 2017

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/s1461157016000292

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Lattice-based Cryptography
• Low-dimensional lattice basis reduction revisited
• Sieve algorithms for the shortest vector problem are practical

Cited In (16)

• A non-heuristic approach to time-space tradeoffs and optimizations for BKW
• Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
• Does the dual-sieve attack on learning with errors even work?
• Shortest vector from lattice sieving: a few dimensions for free
• Sieving for closest lattice vectors (with preprocessing)
• Improved Algorithms for the Approximate k-List Problem in Euclidean Norm
• Advanced lattice sieving on GPUs, with tensor cores
• Modular lattice signatures, revisited
• A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge
• Estimates of implementation complexity for quantum cryptanalysis of post-quantum lattice-based cryptosystems
• Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
• Classical and Quantum 3 and 4-Sieves to Solve SVP with Low Memory
• Estimating quantum speedups for lattice sieves
• Sieve, Enumerate, Slice, and Lift:
• Lower bounds on lattice sieving and information set decoding
• The irreducible vectors of a lattice: some theory and applications

This page was built for publication: Tuple lattice sieving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971007)