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

DOI10.1007/978-3-319-76578-5_14zbMath1439.94033OpenAlexW2789825276MaRDI QIDQ1749293

Gottfried Herold, Thijs Laarhoven, Elena Kirshanova

Publication date: 16 May 2018

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (7)

How to meet ternary LWE keys ⋮ Lower bounds on lattice sieving and information set decoding ⋮ Sieve, Enumerate, Slice, and Lift: ⋮ A non-heuristic approach to time-space tradeoffs and optimizations for BKW ⋮ Revisiting security estimation for LWE with hints from a geometric perspective ⋮ Approximate Voronoi cells for lattices, revisited ⋮ Advanced lattice sieving on GPUs, with tensor cores

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