Aggarwal, DiveshDubey, Chandan2016-10-182016-10-182016-10-18201610.1016/j.ipl.2016.05.003https://infoscience.epfl.ch/handle/20.500.14299/130196WOS:000380069200007The 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.Computational complexityLatticesUnique SVPNP hardnessReductionstext::journal::journal article::research article