Paper 2016/753
Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices
Shi Bai, Damien Stehle, and Weiqiang Wen
Abstract
We present a probabilistic polynomial-time reduction from the lattice Bounded Distance Decoding (BDD) problem with parameter 1/(
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Minor revision. ICALP 2016
- Keywords
- LatticesBounded Distance Decoding ProblemUnique Shortest Vector ProblemSparsification
- Contact author(s)
- weiqiang wen @ ens-lyon fr
- History
- 2016-08-31: last of 2 revisions
- 2016-08-09: received
- See all versions
- Short URL
- https://ia.cr/2016/753
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/753, author = {Shi Bai and Damien Stehle and Weiqiang Wen}, title = {Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices}, howpublished = {Cryptology {ePrint} Archive, Paper 2016/753}, year = {2016}, url = {https://eprint.iacr.org/2016/753} }