A relation of primal-dual lattices and the complexity of shortest lattice vector problem

Theoretical Computer Science

Volumn 207, Issue 1, 1998, Pages 105-116

  Cai, Jin Yi ^a  

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

Author keywords

Interactive proofs; Lattice; NP hardness; Shortest vector problem

Indexed keywords

EID: 0004489099     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00058-9     Document Type: Article

References (24)

1. M. Ajtai, Generating hard instances of lattice problems, in: Proc. 28th Annual ACM Symposium on the Theory of Computing, 1996. Full version available from ECCC, Electronic Colloquium on Computational Complexity TR96-007, at http://www.eccc.uni-trier.de/eccc/.
2. 2 is NP-hard for randomized reductions, Electronic Colloquium on Computational Complexity, TR97-047 at http://www.eccc.uni-trier.de/eccc/.
3. M. Ajtai, C. Dwork. A public-key cryptosystem with worst-case/average-case equivalence, 1996. Available from ECCC, Electronic Colloquium on Computational Complexity TR96-065, at http://www. eccc.uni-trier.de/eccc/.
4. S. Arora, L. Babai, J. Stern, Z. Sweedyk, The hardness of approximate optima in lattices, codes, and systems of linear equations, in: Proc. 34th IEEE Symp. on Foundations of Computer Science (FOCS), 1993, pp. 724-733.
5. L. Babai, On Lovász' lattice reduction and the nearest lattice point problem, Combinatorica 6 (1986) 1-13.
6. W. Banaszczyk, New bounds in some transference theorems in the geometry of numbers, Mathematische Annalen 296 (1993) 625-635.
7. J-Y. Cai, A. Nerurkar, An improved worst-case to average-case connection for lattice problems, in: Proc. 38th IEEE Symp. on Foundations of Computer Science (FOCS), 1997, pp. 468-477.
8. J-Y. Cai, A. Nerurkar, Approximating the SVP to within a factor (1 +(1/dimε)) is NP-hard under randomized reductions, to appear in the Thirteenth Annual IEEE Conference on Computational Complexity, June 1998.
9. O. Goldreich, S. Goldwasser, On the limits of non-approximability of lattice problems, Electronic Colloquium on Computational Complexity TR97-031, at http://www.eccc.uni-trier.de/eccc/.
10. O. Goldreich, S. Goldwasser, S. Halevi, Collision-free hashing from lattice problems, 1996. Available from ECCC, Electronic Colloquium on Computational Complexity TR96-042, at http://www.eccc.uni-trier.de/eccc/.
11. O. Goldreich, S. Goldwasser, S. Halevi, Public-key cryptosystems from lattice reduction problems, 1996. Available from ECCC, Electronic Colloquium on Computational Complexity TR96-056, at http://www.eccc.uni-trier.de/eccc/.
12. M. Grötschel, L. Lovász, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin, 1988.
13. P. M. Gruber, Handbook of Convex Geometry, Elsevier, Amsterdam, 1993.
14. P. M. Gruber, C. G. Lekkerkerker, Geometry of Numbers, North-Holland, Amsterdam, 1987.
15. J. Håstad, Dual vectors and lower bounds for the nearest lattice point problem, Combinatorica 8 (1988) pp. 75-81.
16. J. C. Lagarias, The computational complexity of simultaneous diophantine approximation problems, SIAM J. Comput. 14 (1985) pp. 196-209.
17. J. C. Lagarias, H. W. Lenstra, C. P. Schnorr, Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice, Combinatorica 10 (4) (1990) 333-348.
18. A. K. Lenstra, H. W. Lenstra, L. Lovász, Factoring polynomials with rational coefficients, Mathematische Annalen 261 (1982) 515-534.
19. H. W. Lenstra, Jr., Integer programming with a fixed number of variables, Math. Oper. Res. 8 (1993) 538-548.
20. L. Lovász, An Algorithmic Theory of Numbers, Graphs and Convexity, SIAM, Philadelphia, 1986.
21. J. Milnor, D. Husemoller, Symmetric Bilinear Forms, Springer, Berlin, 1973.
22. C. P. Schnorr, A hierarchy of polynomial time basis reduction algorithms, Theory of Algorithms (1985) 375-386.
23. S. Even, A. L. Selman, Y. Yacobi, The complexity of promise problems with applications to public-key cryptography, information and control 61 (1984) 159-173.
24. 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.