On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem

@inproceedings{Lyubashevsky2009OnBD,
  title={On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem},
  author={Vadim Lyubashevsky and Daniele Micciancio},
  booktitle={CRYPTO},
  year={2009}
}
We prove the equivalence, up to a small polynomial approximation factor √ n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and GapSVP (the decision version of the Shortest Vector Problem). This resolves a long-standing open problem about the relationship between uSVP and the more standard GapSVP, as well the BDD problem commonly used in coding theory. The main cryptographic application of our work is the proof that the Ajtai-Dwork ([AD97… CONTINUE READING
Highly Cited
This paper has 100 citations. REVIEW CITATIONS
63 Citations
30 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 63 extracted citations

100 Citations

01020'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 100 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 30 references

Efficient reductions among lattice problems

  • S. Goldwasser
  • In SODA , pages
  • 2008

Predicting lattice reduction

  • C. Peikert C. Gentry, V. Vaikuntanathan
  • 2008

Ajt96

  • An improved version is described in ECCC
  • M. Ajtai, Generating hard instances of lattice…
  • 2007

Similar Papers

Loading similar papers…