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

Journal of Computer and System Sciences

Volumn 59, Issue 2, 1999, Pages 221-239

  Cai, Jin Yi ^a   Nerurkar, Ajay ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; RANDOM PROCESSES; VECTORS;

RANDOMIZED REDUCTIONS; SHORTEST LATTICE VECTOR PROBLEMS;

COMPUTATIONAL COMPLEXITY;

EID: 0032597114     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1649     Document Type: Article

References (22)

1. 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) 1993, pp. 724-733.
2. M. Ajtai and C. Dwork, A public-key cryptosystem with worst-case/average-case equivalence, in Proc. 29th ACM Symposium on Theory of Computing (STOC), 1997, pp. 284-293. Full version available as TR96-065 from ECCC, Electronic Colloquium on Computational Complexity, at http://www.uni-trier.de/eccc/.
3. M. Ajtai, Generating hard instances of lattice problems, in Proc. 28th ACM Symposium on Theory of Computing (STOC), 1996, pp. 99-108. Full version available as TR96-007 from ECCC, Electronic Colloquium on Complexity, at http://www.uni-trier.de/eccc/.
4. 2 is NP-hard for randomized reduction, in, Proc. 30th ACM Symposium on Theory of Computing (STOC), 1998. Full version available as TR97-047 from ECCC, Electronic Colloquium on Computational Complexity, at http://www.uni-trier.de/eccc/.
5. Cai J.-Y. A relation of primal-dual lattices and the complexity of shortest lattice vector problem. Theoret. Comput. Sci. 207:1998;105-116.
6. 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), 1997, pp. 468-477.
7. Dirichlet P. G. L. Über due Reduktion der positiven quadratischen Formen mit drei unbestimmten ganzen Zahlen. J. Reine Angew. Math. 40:1850;209-227.
8. Gauss C. F. Disquisitiones Arithmeticae. 1801;Fleicher, Leipzig.
9. O. Goldreich, and, S. Goldwasser, On the limits of non-approximability of lattice problems, 1997. Available as TR97-0312 from ECCC, Electronic Colloquium on Computational Complexity, at http:// www.uni-trier.de/eccc/.
10. 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. Gruber P. M., Lekkerkerker C. G. Geometry of Numbers. 1987;North-Holland, Amsterdam.
12. Grötschel M., Lovász L., Schrijver A. Geometric Algorithms and Combinatorial Optimization. 1988;Springer-Verlag, New York/Berlin.
13. Gruber P. M. Handbook of Convex Geometry. 1993;Elsevier Science, Amsterdam.
14. Hermite C. Extraits de lettres de M. Ch. Hermiteà M. Jacobi sur différents objects de la théorie des nombres. J. Reine Angew. Math. 40:1850;261-278.
15. Lagrange J. L. Recherches d'arithmétique. Nouv. Mém. Acad. Roy. Sc. Belles Lett. Berlin. 1773;265-312.
16. 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. Lenstra A. K., Lenstra H. W., Lovász L. Factoring polynomials with rational coefficients. Math. Ann. 261:1982;515-534.
18. Lagarias J., Lenstra H. W., Schnorr C. Korkin-Zolotariev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica. 10:1990;333-348.
19. Lovász L. An Algorithmic Theory of Numbers, Graphs and Convexity. 1986;SIAM, Philadelphia.
20. D. Micciancio, The shortest vector in a lattice is hard to approximate to within some constant, in, Proceedings of FOCS, 1998, to appear. Available as TR98-016 from ECCC, Electronic Colloquium on Computational Complexity, at http://www.uni-trier.de/eccc/.
21. 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. van Emde Boas P. Technical Report. 1981.