CryptoDB
Unique Shortest Vector Problem for max norm is NP-hard
| Authors: | |
|---|---|
| Download: | |
| Abstract: | The unique Shortest vector problem (uSVP) in lattice theory plays a crucial role in many public-key cryptosystems. The security of those cryptosystems bases on the hardness of uSVP. However, so far there is no proof for the proper hardness of uSVP even in its exact version. In this paper, we show that the exact version of uSVP for $\ell_\infty$ norm is NP-hard. Furthermore, many other lattice problems including unique Subspace avoiding problem, unique Closest vector problem and unique Generalized closest vector problem, for any $\ell_p$ norm, are also shown to be NP-hard. |
BibTeX
@misc{eprint-2008-18043,
title={Unique Shortest Vector Problem for max norm is NP-hard},
booktitle={IACR Eprint archive},
keywords={Unique shortest vector problem, unique closest vector problem, unique subspace avoiding problem, Lattice, NP-hard, Lattice-based cryptosystems},
url={http://eprint.iacr.org/2008/366},
note={ quangkhoat@gmail.com 14117 received 25 Aug 2008, last revised 26 Aug 2008},
author={Than Quang Khoat and Nguyen Hong Tan},
year=2008
}