Approximating shortest lattice vectors is not harder than approximating closest lattice vectors

Information Processing Letters

Volumn 71, Issue 2, 1999, Pages 55-61

  Goldreich, O ^a   Micciancio, D ^b   Safra, S ^c   Seifert, J P ^d  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

^d GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ERROR CORRECTION; POLYNOMIALS; RANDOM PROCESSES; VECTORS;

CLOSEST VECTOR PROBLEM; LINEAR ERROR CORRECTING CODE; SHORTEST VECTOR PROBLEM;

COMPUTATIONAL COMPLEXITY;

EID: 0032613321     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(99)00083-6     Document Type: Article

References (16)

1. M. Ajtai, The shortest vector problem is NP-hard for randomized reductions, in: Proc. 30th Annual ACM Symposium on Theory of Computing (STOC'98), Dallas, TX, May 1998, pp. 10-19.
2. S. Arora, L. Babai, J. Stern, Z. Sweedyk, The hardness of approximate optima in lattices, codes, and systems of linear equations, J. Comput. System Sci. 54 (2) (1997) 317-331.
3. E.R. Berlekamp, R.J. McEliece, H.C.A. van Tilborg, On the inherent intractability of certain coding problems, IEEE Trans. Inform. Theory IT-24 (3) (1978) 384-386.
4. L. Babai, On Lovász' lattice reduction and the nearest lattice point problem, Combinatorica 6 (1) (1986) 1-13.
5. I. Dinur, G. Kindler, S. Safra, Approximating CVP to within almost-polynomial factors is NP-hard, in: Proc. 39th Symposium on Foundations of Computer Science (FOCS'98), Palo Alto, CA, November 1998, pp. 99-109.
6. I. Dumer, D. Micciancio, M. Sudan, Hardness of approximating the minimum distance of a linear code, in: Proc. 40th Symposium on Foundations of Computer Science (FOCS'99), New York, October 1999.
7. J. Feigenbaum, G.D. Forney Jr., B.H. Marcus, R.J. McEliece, A. Vardy, Introduction to the Special Issue on Codes and Complexity, IEEE Trans. Inform. Theory 42 (6) (1996) 1649-1657.
8. M. Henk, Note on shortest and nearest lattice vectors, Inform. Process. Lett. 61 (4) (1997) 183-188.
9. R. Kannan, Algorithmic geometry of numbers, Ann. Reviews Comput. Sci. 2 (1987) 231-267.
10. R. Kumar, D. Sivakumar, A note on the shortest lattice vector problem, in: Proc. 14th Annual IEEE Conference on Computational Complexity (Complexity'99), Atlanta, GA, May 1999, pp. 200-204.
11. A.K. Lenstra, H.W. Lenstra, L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (4) (1982) 515-534.
12. D. Micciancio, The shortest vector in a lattice is hard to approximate to within some constant, in: Proc. 39th Symposium on Foundations of Computer Science (FOCS'98), Palo Alto, CA, November 1998, pp. 92-98.
13. C.P. Schnorr, A hierarchy of polynomial time lattice basis reduction algorithms, Theoret. Comput. Sci. 53 (2-3) (1987) 201-224.
14. M.A. Tsfasman, S.G. Vlǎduts, Algebraic Geometry Codes, Mathematics and its Applications 58 (Kluwer Academic, Dordrecht, 1991).
15. A. Vardy, Algorithmic complexity in coding theory and the minimum distance problem, in: Proc. 29th Annual ACM Symposium on Theory of Computing (STOC'97), El Paso, TX, May 1997, pp. 92-109.
16. P. van Emde Boas, Another NP-complete problem and the complexity of computing short vectors in a lattice, Report 81-04, Mathematisch Instituut, Universiteit Amsterdam (1981).