Tuple lattice sieving

DOI10.1112/S1461157016000292zbMath1404.11140OpenAlexW2516575385MaRDI QIDQ2971007

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

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

Related Items (13)

Lower bounds on lattice sieving and information set decoding ⋮ Sieve, Enumerate, Slice, and Lift: ⋮ Shortest vector from lattice sieving: a few dimensions for free ⋮ A non-heuristic approach to time-space tradeoffs and optimizations for BKW ⋮ Does the dual-sieve attack on learning with errors even work? ⋮ Sieving for closest lattice vectors (with preprocessing) ⋮ Estimating quantum speedups for lattice sieves ⋮ The irreducible vectors of a lattice: some theory and applications ⋮ Improved Algorithms for the Approximate k-List Problem in Euclidean Norm ⋮ A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge ⋮ Modular lattice signatures, revisited ⋮ Advanced lattice sieving on GPUs, with tensor cores ⋮ Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs

Cites Work

• Sieve algorithms for the shortest vector problem are practical
• Lattice-based Cryptography
• Unnamed Item

This page was built for publication: Tuple lattice sieving