Hardness of approximating the shortest vector problem in lattices

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 126-135

  Khot, Subhash ^a,b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSEST VECTOR PROBLEM (CVP); POLYNOMIAL TIME; RANDOMIZED REDUCTIONS; SHORTEST VECTOR PROBLEM (SVP);

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; POLYNOMIALS; RANDOM PROCESSES; VECTORS;

PROBLEM SOLVING;

EID: 17744386194     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. D. Aharonov, O. Regev. Lattice problems in NP ⊂ coNP. Manuscript, 2004.
2. th Annual ACM Symposium on the Theory of Computing, 1998 pp 10-19.
3. th Annual ACM Symposium on the Theory of Computing, 1996, pp 99-108.
4. th Annual ACM Symposium on the Theory of Computing, 1997, pp 284-293.
5. rd Annual ACM Symposium on the Theory of Computing, 2001, pp 601-610.
6. N. Alon, J. Spencer, P. Erdos. The probabilistic method. Wiley-Interscience Series.
7. S. Arora, L. Babai, J. Stern, E.Z. Sweedyk. The hardness of approximate optima in lattices, codes and systems of linear equations. Journal of Computer and Systems Sciences (54), 1997, pp 317-331.
8. W. Banaszczyk. New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen, vol. 296,1993, pp 625-635.
9. th Annual IEEE Conference on Computational Complexity, 1999.
10. th Annual IEEE Conference on Computational Complexity, 1998, pp 151-158.
11. th IEEE Symposium on Foundations of Computer Science, 1997.
12. ∞ to within almost polynomial factors is NP-hard. Proc. of the 4th Italian Conference on Algorithms and Complexity, LNCS, vol 1767, Springer, 2000.
13. I. Dinur, G. Kindler, S. Safra. Approximating CVP to within almost-polynomial factors is NP-hard. In Proc. of the 39 IEEE Symposium on Foundations of Computer Science, 1998.
14. th IEEE Symposium on Foundations of Computer Science, 1999.
15. C.F. Gauss. Disquisitiones arithmeticae. (leipzig 1801), art. 171. Yale Univ. Press, 1966. English translation by A.A. Clarke.
16. th Annual ACM Symposium on the Theory of Computing, 1998. pp 1-9.
17. J. Håstad. Dual vectors and lower bounds for the nearest lattice point problem. Combinatorica, vol. 8, 1988, pp 75-81.
18. th Annual ACM Symposium on Theory of Computing, 1983, pp 193-206.
19. R. Kannan. Minkowski's convex body theorem and integer programming. Mathematics of Operations Research, 12:415-440, 1987.
20. th IEEE Symposium on Foundations of Computer Science, 2003.
21. R. Kumar, D. Sivakumar. Complexity of SVP - A reader's digest. SIGACT News, 32(3), Complexity Theory Column (ed. L. Hemaspaandra), 2001, pp 40-52.
22. J.C. Lagarias, H.W. Lenstra, C.P. Schnorr. Korkine-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica, vol 10, 1990, pp 333-348.
23. J.C. Lagarias, A.M. Odlyzko. Solving low-density subset sum problems. Journal of the ACM, 32(1), 1985, pp 229-246
24. S. Landau, G.L. Miller. Solvability of radicals is in polynomial time. Journal of Computer and Systems Sciences, 30(2), 1985, pp 179-208.
25. H.W. Lenstra. Integer programming with a fixed number of variables. Tech. Report 81-03, Univ. of Amsterdam, Amstredam, 1981.
26. A.K. Lenstra, H.W. Lenstra, L. Lovász. Factoring polynomials with rational coefficients. Mathematische Ann., 261, 1982, pp 513-534.
27. th IEEE Symposium on Foundations of Computer Science, 1998.
28. D. Micciancio, S. Goldwasser. Complexity of lattice problems, A cryptographic perspective. Kluwer Academic Publishers, 2002.
29. H. Minkowski. Geometrie der zahlen. Leizpig, Tuebner, 1910.
30. th Annual ACM Symposium on the Theory of Computing, 2003.
31. C.P. Schnorr. A hierarchy of polynomial-time basis reduction algorithms. In Proc. of Conference on Algorithms, Péecs (Hungary), 1985, pp 375-386.
32. P. van Emde Boas. Another NP-complete problem and the complexity of computing short vectors in a lattice. Tech. Report 81-04, Mathematische Instiut, Univ. of Amsterdam, 1981.