On Bounded Distance Decoding for General Lattices

DOI10.1007/11830924_41zbMath1155.94409OpenAlexW1536683582MaRDI QIDQ3595403

Daniele Micciancio, Yi-Kai Liu, Vadim Lyubashevsky

Publication date: 28 August 2007

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11830924_41

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decoding (94B35)

Related Items (10)

Dual lattice attacks for closest vector problems (with preprocessing) ⋮ Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE ⋮ Classical reduction of gap SVP to LWE: a concrete security analysis ⋮ Hardness of approximating the closest vector problem with pre-processing ⋮ Algorithms for the Shortest and Closest Lattice Vector Problems ⋮ The Geometry of Lattice Cryptography ⋮ A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic ⋮ Hardness of bounded distance decoding on lattices in lp norms ⋮ Kissing Numbers and Transference Theorems from Generalized Tail Bounds ⋮ A note on BDD problems with \(\lambda_2\)-gap

This page was built for publication: On Bounded Distance Decoding for General Lattices