Hardness of approximating the shortest vector problem in lattices

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Let p > 1 be any fixed real. We show that assuming NP ⊂ RP, it is hard to approximate the Shortest Vector Problem (SVP) in l p norm within an arbitrarily large constant factor. Under the stronger assumption NP ⊂ RTIME(2 poly((lop n)), we show that the problem is hard to approximate within factor 2(log n) 1/2-ε where n is the dimension of the lattice and ε > 0 is an arbitrarily small constant. This greatly improves all previous results in p norms with 1 < p < ∞. The best results so far gave only a constant factor hardness, namely, 2 1/p - ε by Micciancio [27] and 1/ε in high l p norms by Knot [20]. We first give a new (randomized) reduction from Closest Vector Problem (CVP) to SVP that achieves some constant factor hardness. The reduction is based on BCH Codes. Its advantage is that the SVP instances produced by the reduction behave well under the augmented tensor product, a new variant of tensor product that we introduce. This enables us to boost the hardness factor to 2(log n) 1/2-ε.

Original languageEnglish (US)
Title of host publicationProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Pages126-135
Number of pages10
StatePublished - 2004
EventProceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004 - Rome, Italy
Duration: Oct 17 2004Oct 19 2004

Other

OtherProceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004
CountryItaly
CityRome
Period10/17/0410/19/04

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Hardness of approximating the shortest vector problem in lattices'. Together they form a unique fingerprint.

Cite this