On Bounded Distance Decoding for General Lattices
From MaRDI portal
Publication:3595403
DOI10.1007/11830924_41zbMATH Open1155.94409OpenAlexW1536683582MaRDI QIDQ3595403FDOQ3595403
Authors: Yi-Kai Liu, Vadim Lyubashevsky, Daniele Micciancio 
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
Recommendations
- Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- The inapproximability of lattice and coding problems with preprocessing
- Improved Inapproximability of Lattice and Coding Problems With Preprocessing
- scientific article; zbMATH DE number 6820265
Cited In (15)
- Dual lattice attacks for closest vector problems (with preprocessing)
- Hardness of bounded distance decoding on lattices in lp norms
- The geometry of lattice cryptography
- Title not available (Why is that?)
- Hardness of approximating the closest vector problem with pre-processing
- A note on BDD problems with \(\lambda_2\)-gap
- Algorithms for the shortest and closest lattice vector problems
- Kissing Numbers and Transference Theorems from Generalized Tail Bounds
- Non-Random Coding Error Bounds for Lattices
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- Generalized minimum-distance decoding of Euclidean-space codes and lattices
- Title not available (Why is that?)
- Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE
- Classical reduction of gap SVP to LWE: a concrete security analysis
- A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic
This page was built for publication: On Bounded Distance Decoding for General Lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595403)
