Finding closest lattice vectors using approximate Voronoi cells

DOI10.1007/978-3-030-25510-7_1MaRDI QIDQ2302118zbMATH OpenOpenAlexFDO

Authors Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger

Publication date 25 February 2020

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

zbMATH Keywords

Closest Vector problem (CVP)latticespreprocessingShortest Vector problem (SVP)sieving algorithmsVoronoi cells

Mathematics Subject Classification ID

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

Recommendations

• Sieving for closest lattice vectors (with preprocessing)
• Approximate Voronoi cells for lattices, revisited
• A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
• A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
• Short paths on the Voronoi graph and closest vector problem with preprocessing

Cited in

(23)

• Sieving for closest lattice vectors (with preprocessing)
• 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
• Quantum security analysis of CSIDH
• The irreducible vectors of a lattice: some theory and applications
• Nearest planes in practice
• Sieve, Enumerate, Slice, and Lift:
• A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic
• Short paths on the Voronoi graph and closest vector problem with preprocessing
• New Results on the Remote Set Problem and Its Applications in Complexity Study
• A review of mathematical and computational aspects of CSIDH algorithms
• Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
• Cryptanalysis of LWE and SIS-based cryptosystems by using quantum annealing
• The identification of parameter in a finite set under one-bit quantized observations
• Faster SCALLOP from non-prime conductor suborders in medium sized quadratic fields
• Heuristic algorithm for solving restricted SVP and its applications
• A new quantum oracle model for a hybrid quantum-classical attack on post-quantum lattice-based cryptosystems
• Fast slicer for Batch-CVP: making lattice hybrid attacks practical
• Diagonally dominant matrices for cryptography
• Dual lattice attacks for closest vector problems (with preprocessing)
• Finding nearest neighbors with Voronoi tessellations

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

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