On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem.
Saved in:
| Title: | On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem. |
|---|---|
| Authors: | Lyubashevsky, Vadim, Micciancio, Daniele |
| Source: | Advances in Cryptology - CRYPTO 2009; 2009, p577-594, 18p |
| Abstract: | We prove the equivalence, up to a small polynomial approximation factor ]> , 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 ([2]) and the Regev ([33]) cryptosystems, which were previously only known to be based on the hardness of uSVP, can be equivalently based on the hardness of worst-case GapSVP ]> and GapSVP ]> , respectively. Also, in the case of uSVP and BDD, our connection is very tight, establishing the equivalence (within a small constant approximation factor) between the two most central problems used in lattice based public key cryptography and coding theory. [ABSTRACT FROM AUTHOR] |
| Copyright of Advances in Cryptology - CRYPTO 2009 is the property of Springer Nature / Books and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
Be the first to leave a comment!