Tuple lattice sieving

DOI10.1112/S1461157016000292MaRDI QIDQ2971007zbMATH OpenOpenAlexFDO

Authors Shi Bai, Thijs Laarhoven, Damien Stehlé

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)

Recommendations

• Speed-ups and time-memory trade-offs for tuple lattice sieving
• Shortest vector from lattice sieving: a few dimensions for free
• A new lattice sieving algorithm base on angular locality-sensitive hashing
• Progressive lattice sieving
• Efficient (ideal) lattice sieving using cross-polytope LSH

Cites work

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

Cited in

(21)

• Progressive lattice sieving
• Shortest vector from lattice sieving: a few dimensions for free
• Sieving for closest lattice vectors (with preprocessing)
• Speed-ups and time-memory trade-offs for tuple lattice sieving
• Advanced lattice sieving on GPUs, with tensor cores
• Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
• Lower bounds on lattice sieving and information set decoding
• Modular lattice signatures, revisited
• Estimating quantum speedups for lattice sieves
• The irreducible vectors of a lattice: some theory and applications
• A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
• Sieve, Enumerate, Slice, and Lift:
• Improved algorithms for the approximate k-List problem in Euclidean norm
• A non-heuristic approach to time-space tradeoffs and optimizations for BKW
• Does the dual-sieve attack on learning with errors even work?
• Classical and Quantum 3 and 4-Sieves to Solve SVP with Low Memory
• Estimates of implementation complexity for quantum cryptanalysis of post-quantum lattice-based cryptosystems
• Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
• Accurate score prediction for Dual-Sieve attacks
• Research of k-sieve algorithm for solving the shortest vector problem in a lattice
• Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding

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)