Hardness of approximating the Shortest Vector Problem in high ℓp norms

Journal of Computer and System Sciences

Volumn 72, Issue 2, 2006, Pages 206-219

  Khot, Subhash ^a  

^a Princeton University   (United States)

Author keywords

Approximation algorithms; Computational complexity; Hardness of approximation; Lattices; Shortest vector problem

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CRYSTAL LATTICES; HARDNESS; INTEGER PROGRAMMING; POLYNOMIALS;

APPROXIMATION ALGORITHMS; HARDNESS OF APPROXIMATION; SHORTEST VECTOR PROBLEM;

VECTORS;

EID: 32844474679     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2005.07.002     Document Type: Article

References (35)

1. D. Aharonov, O. Regev, Lattice problems in NP ∩ coNP, in: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, 2004, pp. 362-371.
2. M. Ajtai, Generating hard instances of lattice problems, in: Proceedings of the 28th ACM Symposium on the Theory of Computing, 1996, pp. 99-108.
3. 2 is NP-hard for randomized reductions, in: Proceedings of the 30th ACM Symposium on the Theory of Computing, 1998, pp. 10-19.
4. M. Ajtai, C. Dwork, A public-key cryptosystem with worst-case/average- case equivalence, in: Proceedings of the 29th ACM Symposium on the Theory of Computing, 1997, pp. 284-293.
5. M. Ajtai, R. Kumar, D. Sivakumar, A sieve algorithm for the shortest lattice vector problem, in: Proceedings of the 33rd ACM Symposium on the Theory of Computing, 2001, pp. 601-610.
6. S. Arora, L. Babai, J. Stern, and E.Z. Sweedyk The hardness of approximate optima in lattices, codes and systems of linear equations J. Comput. System Sci. 54 1997 317 331
7. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy Proof verification and the hardness of approximation problems J. ACM 45 3 1998 501 555
8. S. Arora, and S. Safra Probabilistic checking of proofs: a new characterization of NP J. ACM 45 1 1998 70 122
9. J.Y. Cai Applications of a new transference theorem to Ajtai's connection factor Discrete Appl. Math. 126 1 2003 9 31
10. J.Y. Cai, A. Nerurkar, An improved worst-case to average-case connection for lattice problems, in: Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, 1997.
11. ε ) is NP-hard under randomized reductions J. Comput. System Sci. 59 2 1999 221 239
12. ∞ to within almost polynomial factors is NP-hard Combinatorica 23 2 2003 205 243
13. I. Dinur, G. Kindler, R. Raz, and S. Safra Approximating CVP to within almost-polynomial factors is NP-hard Combinatorica 23 2 2003 205 243
14. U. Feige, M. Halldorsson, G. Kortsarz, Approximating the domatic number, in: Proceedings of the 32nd Symposium on the Theory of Computing, 2000, pp. 134-143.
15. C.F. Gauss, Disquisitiones arithmeticae. (leipzig 1801), art. 171, Yale University Press, 1966. (English translation by A.A. Clarke).
16. O. Goldreich, and S. Goldwasser On the limits of non-approximability of lattice problems J. Comput. System Sci. 60 3 2000 540 563
17. J. Håstad Some optimal inapproximability results J. ACM 48 2001 798 859
18. R. Kannan, Improved algorithms for integer programming and related lattice problems, in: Proceedings of the 15th ACM Symposium on Theory of Computing, 1983, pp. 193-206.
19. R. Kannan Minkowski's convex body theorem and integer programming Math. Oper. Res. 12 1987 415 440
20. S. Khot, Hardness of approximating the shortest vector problem in lattices, in: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, 2004, pp. 126-135.
21. p norm, manuscript, 2004.
22. R. Kumar, D. Sivakumar, Complexity of SVP - a reader's digest, SIGACT News, vol. 32(3), in: L. Hemaspaandra (Ed.), Complexity Theory Column, 2001, pp. 40-52.
23. J. Lagarias, H. Lenstra, and C. Schnorr Korkine-Zolotarev bases and successive minima of a lattice and its reciprocal lattice Combinatorica 10 1990 333 348
24. J. Lagarias, and A. Odlyzko Solving low-density subset sum problems J. ACM 32 1 1985 229 246
25. S. Landau, and G. Miller Solvability of radicals is in polynomial time J. Comput. System Sci. 30 2 1985 179 208
26. H. Lenstra, Integer programming with a fixed number of variables, Technical Report 81-03, University of Amsterdam, Amsterdam, 1981.
27. A. Lenstra, H. Lenstra, and L. Lovász Factoring polynomials with rational coefficients Math. Ann. 261 1982 513 534
28. D. Micciancio, Ph.D. Thesis, MIT, 1998.
29. D. Micciancio The shortest vector problem is NP-hard to approximate to within some constant SIAM J. Comput. 30 6 2001 2008 2035
30. D. Micciancio, and S. Goldwasser Complexity of Lattice Problems, a Cryptographic Perspective 2002 Kluwer Academic Publishers Dordrecht
31. H. Minkowski, Geometrie der zahlen, Leizpig, Tuebner, 1910.
32. R. Raz A parallel repetition theorem SIAM J. Comput. 27 3 1998 763 803
33. O. Regev, New lattice based cryptographic constructions, in: Proceedings of the 35th ACM Symposium on the Theory of Computing, 2003.
34. C.P. Schnorr A hierarchy of polynomial-time basis reduction algorithms Theoret. Comput. Sci. 53 2-3 1987 201 224
35. P. van Emde Boas, Another NP-complete problem and the complexity of computing short vectors in a lattice, Technical Report 81-04, Mathematische Instiut, University of Amsterdam, Amsterdam, 1981.