Lattice problems and norm embeddings

We present reductions from lattice problems in the 2 norm to the corresponding problems in other norms such as 1, (and in fact in any other p norm where 1 p ). We consider lattice problems such as the Shortest Vector Problem, Shortest Independent Vector Problem, Closest Vector Problem and the Closest Vector Problem with Preprocessing. The reductions are based on embeddings of normed spaces. Among other things, our reductions imply that the Shortest Vector Problem in the 1 norm and the Closest Vector Problem with Preprocessing in the norm are hard to approximate to within any constant (and beyond). Previously, the former problem was known to be hard to approximate to within 2 - , while no hardness result was known for the latter problem.

• Type: Conference
• Year: 2006
• Where: STOC
• Authors: Oded Regev, Ricky Rosen
• Keywords: Algorithms, Closest Vector Problem, Shortest Vector Problem, STOC 2006, Vector Problem