Progressive lattice sieving

DOI10.1007/978-3-319-79063-3_14zbMath1425.94066OpenAlexW2794791038MaRDI QIDQ1644775

Thijs Laarhoven, Artur Mariano

Publication date: 22 June 2018

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

zbMATH Keywords

lattice-based cryptographynearest neighbor searchinglattice sievingShortest Vector problem (SVP)

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (10)

Sieve, Enumerate, Slice, and Lift: ⋮ Shortest vector from lattice sieving: a few dimensions for free ⋮ Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS ⋮ A non-heuristic approach to time-space tradeoffs and optimizations for BKW ⋮ Development and analysis of massive parallelization of a lattice basis reduction algorithm ⋮ Approximate Voronoi cells for lattices, revisited ⋮ On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem ⋮ Advanced lattice sieving on GPUs, with tensor cores ⋮ Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes ⋮ Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)

This page was built for publication: Progressive lattice sieving