Improved hardness results for unique shortest vector problem

The unique shortest vector problem on a rational lattice is the problem of finding the shortest non-zero vector under the promise that it is unique (up to multiplication by -1). We give several incremental improvements on the known hardness of the unique shortest vector problem (uSVP) using standard techniques. This includes a deterministic reduction from the shortest vector problem to the uSVP, the NP-hardness of uSVP on (1 + 1/poly(n))-unique lattices, and a proof that the decision version of uSVP defined by Cai [4] is in co-NP for n(1/4)-unique lattices. (C) 2016 Published by Elsevier B.V.


Published in:
Information Processing Letters, 116, 10, 631-637
Year:
2016
Publisher:
Amsterdam, Elsevier
ISSN:
0020-0190
Keywords:
Laboratories:




 Record created 2016-10-18, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)