International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
Vadim Lyubashevsky
Daniele Micciancio
Download:
DOI: 10.1007/978-3-642-03356-8_34 (login may be required)
URL: https://www.iacr.org/archive/crypto2009/56770568/56770568.pdf
Search ePrint
Search Google
Conference: CRYPTO 2009
BibTeX
@inproceedings{crypto-2009-23896,
  title={On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem},
  booktitle={Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={5677},
  pages={577-594},
  url={https://www.iacr.org/archive/crypto2009/56770568/56770568.pdf},
  doi={10.1007/978-3-642-03356-8_34},
  author={Vadim Lyubashevsky and Daniele Micciancio},
  year=2009
}