Skip to Main content Skip to Navigation
Journal articles

Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors

Ishay Haviv 1 Oded Regev 2, 1 
2 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities
DI-ENS - Département d'informatique - ENS Paris, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548
Abstract : We show that unless NP⊆RTIME(2poly(logn)), there is no polynomial-time algorithm approximating the Shortest Vector Problem (SVP) on n-dimensional lattices in the ℓp norm (1≤p<∞) to within a factor of 2(logn)1−ε for any ε>0. This improves the previous best factor of 2(logn)1/2−ε under the same complexity assumption due to Khot (J. ACM, 2005). Under the stronger assumption NP⊈RSUBEXP, we obtain a hardness factor of nc/loglogn for some c>0. Our proof starts with Khot's SVP instances that are hard to approximate to within some constant. To boost the hardness factor we simply apply the standard tensor product of lattices. The main novel part is in the analysis, where we show that the lattices of Khot behave nicely under tensorization. At the heart of the analysis is a certain matrix inequality which was first used in the context of lattices by de Shalit and Parzanchevski.
Document type :
Journal articles
Complete list of metadata
Contributor : Brigitte Briot Connect in order to contact the contributor
Submitted on : Friday, January 30, 2015 - 3:29:53 PM
Last modification on : Thursday, March 17, 2022 - 10:08:38 AM

Links full text




Ishay Haviv, Oded Regev. Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors. Theory of Computing, University of Chicago, Department of Computer Science, 2012, 8 (1), pp.513-531. ⟨10.4086/toc.2012.v008a023⟩. ⟨hal-01111558⟩



Record views