The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant

We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with inverse polynomial error probability. In particular, approximating the shortest vector problem is not in RP (random polynomial time), unless NP equals RP. We also prove a proper NP-hardness result (i.e., hardness under deterministic many-one reductions) under a reasonable number theoretic conjecture on the distribution of square-free smooth numbers. As part of our proof, we give an alternative construction of Ajtai's constructive variant of Sauer's lemma that greatly simplifies Ajtai's original proof. Key words. NP-hardness, shortest vector problem, point lattices, geometry of numbers, sphere packing AMS subject classifications. 68Q25, 68W25, 11H06, 11P21, 11N25 PII. S0097539700373039

• Type: Conference
• Year: 1998
• Where: FOCS
• Authors: Daniele Micciancio
• Keywords: FOCS 1998, Inverse Polynomial Error, Shortest Vector Problem, Theoretical Computer Science, Unfaithful Random Reductions