On Bounded Distance Decoding for General Lattices

@inproceedings{Liu2006OnBD,
  title={On Bounded Distance Decoding for General Lattices},
  author={Yi-Kai Liu and Vadim Lyubashevsky and Daniele Micciancio},
  booktitle={APPROX-RANDOM},
  year={2006}
}
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice $\mathcal{L}$ represented by some basis, and a target point $\vec{y}$, find the lattice point closest to $\vec{y}$. Bounded Distance Decoding is a variant of this problem in which the target is guaranteed to be close to the lattice, relative to the minimum distance $\lambda_1(\mathcal{L})$ of the lattice. Specifically, in the α-Bounded Distance Decoding problem (α-BDD), we are given a lattice… CONTINUE READING

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 36 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 22 REFERENCES

Improved Inapproximability of Lattice and Coding Problems With Preprocessing

  • IEEE Trans. Information Theory
  • 2004
VIEW 16 EXCERPTS
HIGHLY INFLUENTIAL

Lattice Problems in NP ∩ coNP

VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

The shortest vector problem is NP-hard to approximate to within some constant

D. Micciancio
  • SIAM J. on Computing,
  • 2001
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Approximating-CVP to within almost-polynomial factors is NP-hard

  • Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
  • 1998
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

The hardness of approximate optima in lattices, codes, and systems of linear equations

  • Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
  • 1993
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL