Speed-ups and time-memory trade-offs for tuple lattice sieving

DOI10.1007/978-3-319-76578-5_14zbMATH Open1439.94033OpenAlexW2789825276MaRDI QIDQ1749293FDOQ1749293

Authors: Gottfried Herold, Elena Kirshanova, Thijs Laarhoven 

Publication date: 16 May 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-76578-5_14

Recommendations

• Tuple lattice sieving
• Shortest vector from lattice sieving: a few dimensions for free
• A new lattice sieving algorithm base on angular locality-sensitive hashing
• Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing

zbMATH Keywords

lattice-based cryptographylattice sievingShortest Vector problem (SVP)nearest neighbor algorithms

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Cited In (10)

• A non-heuristic approach to time-space tradeoffs and optimizations for BKW
• Approximate Voronoi cells for lattices, revisited
• Advanced lattice sieving on GPUs, with tensor cores
• How to meet ternary LWE keys
• Revisiting security estimation for LWE with hints from a geometric perspective
• Title not available (Why is that?)
• Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
• Classical and Quantum 3 and 4-Sieves to Solve SVP with Low Memory
• Sieve, Enumerate, Slice, and Lift:
• Lower bounds on lattice sieving and information set decoding

This page was built for publication: Speed-ups and time-memory trade-offs for tuple lattice sieving

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