Finding closest lattice vectors using approximate Voronoi cells

DOI10.1007/978-3-030-25510-7_1zbMath1447.94033OpenAlexW2959677688MaRDI QIDQ2302118

Thijs Laarhoven, Benne de Weger, Emmanouil Doulgerakis

Publication date: 25 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-25510-7_1

zbMATH Keywords

latticesVoronoi cellspreprocessingShortest Vector problem (SVP)Closest Vector problem (CVP)sieving algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Combinatorics in computer science (68R05) Cryptography (94A60)

Related Items (9)

Dual lattice attacks for closest vector problems (with preprocessing) ⋮ Sieve, Enumerate, Slice, and Lift: ⋮ The irreducible vectors of a lattice: some theory and applications ⋮ Approximate Voronoi cells for lattices, revisited ⋮ The randomized slicer for CVPP: sharper, faster, smaller, batchier ⋮ Threshold schemes from isogeny assumptions ⋮ On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem ⋮ A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic ⋮ Quantum security analysis of CSIDH

This page was built for publication: Finding closest lattice vectors using approximate Voronoi cells