Approximating the SVP to within a factor (1+1/dimϵ) is NP-hard under randomized conditions

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1998, Pages 46-55

  Cai, J Y ^a   Nerurkar, A ^a  

^a the State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

L2-NORM; LATTICE VECTORS; LP-NORM; NP-HARD; RANDOMIZED REDUCTIONS;

COMPUTATIONAL COMPLEXITY;

EID: 85041140560     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.1998.694590     Document Type: Conference Paper

References (22)

1. [ABSS93] S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear equations. In Proc. 34th IEEE Symposium on Foundations of Computer Science (FOCS), 724-733, 1993.
2. [AD96] M. Ajtai and C. Dwork. A public-key cryptosystem with worst-case/averagecase equivalence. 1996. Available as TR96-065 from ECCC, Electronic Colloquium on Computational Complexity, at http://www.uni-trier.de/eccc/.
3. [Ajt96] M. Ajtai. Generating hard instances of lattice problems. In Proc. 28th ACM Symposium on Theory of Computing (STOC), 99-108, 1996. Full version available as TR96-007 from ECCC, Electronic Colloquium on Computational Complexity, at http://www.uni-trier.de/eccc/.
4. [Ajt97] M. Ajtai. The shortest vector problem in L2 is NP-hard for randomized reductions. 1997. Available as TR97-047 from ECCC, Electronic Colloquium on Computational Complexity, at http://www.uni-trier.de/eccc/. Will also appear in Proc. 30th ACM Symposium on Theory of Computing (STOC), 1998.
5. [Cai] J-Y Cai. A relation of primal-dual lattices and the complexity of shortest lattice vector problem. Theoretical Computer Science. To appear.
6. [CN97] J-Y Cai and A. Nerurkar. An improved worst-case to average-case connection for lattice problems. In Proc. 38th IEEE Symposium on Foundations of Computer Science (FOCS), 468-477, 1997.
7. [Dir50] P. G. L. Dirichlet. Über die Reduktion der positiven quadratischen Formen mit drei unbestimmten ganzen Zahlen. Journal für die Reine und Angewandte Mathematik, 40:209-227, 1850.
8. [Gau01] C. F. Gauss. Disquisitiones Arithmeticae. Fleischer, Leipzig, 1801. English transl. by A. A. Clarke. Yale University Press, 1966.
9. [GG97] O. Goldreich and S. Goldwasser. On the limits of non-approximability of lattice problems. 1997. Available as TR97-031 from ECCC, Electronic Colloquium on Computational Complexity, at http://www.uni-trier.de/eccc/.
10. [GGH96] O. Goldreich, S. Goldwasser, and S. Halevi. Public-key cryptosystems from lattice reduction problems. 1996. Available as TR96-056 from ECCC, Electronic Colloquium on Computational Complexity, at http://www.uni-trier.de/eccc/.
11. [GL87] P. M. Gruber andC. G. Lekkerkerker. Geometry of Numbers. North-Holland, 1987.
12. [GLS88] M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer Verlag, 1988.
13. [Gru93] P. M. Gruber. Handbook of Convex Geometry. Elsevier Science Publishers B.V., 1993.
14. [Her50] C. Hermite. Extraits de lettres de M. Ch. Hermite à M. Jacobi sur différents objets de la théorie des nombres. Journal für die Reine und Angewandte Mathematik, 40:261-278, 279-290, 291-307, 308-315, 1850.
15. [Lag73] J. L. Lagrange. Recherches d'arithmétique. Nouv. Mém. Acad. Roy. Sc. Belles Lettres Berlin, pages 265-312, 1773. [Oeuvres, Vol. 3 (Gauthier-Villars, Paris, 1869) pp. 693-758].
16. [Lag82] J. C. Lagarias. The computational complexity of simultaneous diophantine approximation problems. In Proc. 23rd IEEE Symposium on Foundations of Computer Science (FOCS), 32-39, 1982.
17. [LLL82] A. K. Lenstra, H. W. Lenstra, and L. Lovász. Factoring polynomials with rational coefficients. Mathematische Annalen, 261:515-534, 1982.
18. [LLS90] J. Lagarias, H. W. Lenstra, and C. Schnorr. Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica, 10(4):333-348, 1990.
19. [Lov86] L. Lovász. An Algorithmic Theory of Numbers, Graphs and Convexity. SIAM, Philadelphia, 1986.
20. [Mic98] D. Micciancio. The shortest vector in a lattice is hard to approximate to within some constant. 1998. Available as TR98-016 from ECCC, Electronic Colloquium on Computational Complexity, at http://www.uni-trier.de/eccc/.
21. [NS98] P. Nguyen and J. Stern. A converse to the Ajtai-Dwork security proof and its cryptographic implications. 1998. Available as TR98-010 from ECCC, Electronic Colloquium on Computational Complexity, at http://www.uni-trier.de/eccc/.
22. [vEB81] P. van Emde Boas. Another NP-complete partition problem and the complexity of computing short vectors in lattices. Technical Report 81-04, Mathematics Department, University of Amsterdam, 1981.