Sampling methods for shortest vectors, closest vectors and successive minima

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4596 LNCS, Issue , 2007, Pages 65-77

  Blömer, Johannes ^a   Naewe, Stefanie ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; POLYNOMIALS; PROBLEM SOLVING; VECTORS;

CLOSEST VECTORS; SHORTEST VECTORS;

SAMPLING;

EID: 38149019948     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_8     Document Type: Conference Paper

References (17)

1. 2 is NP-hard for randomized reductions. In: Proceedings of the 30th ACM Symposium on Theory of Computing, pp. 10-19. ACM Press, New York (1998)
2. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the 33th ACM Symposium on Theory of Computing, pp. 601-610. ACM Press, New York (2001)
3. Ajtai, M., Kumar, R., Sivakumar, D.: Sampling short lattice vectors and the closest lattice vector problem. In: Proceedings of the 17th IEEE Annual Conference on Computational Complexity - CCC, pp. 53-57. IEEE Computer Society Press, Los Alamitos (2002)
4. Babai, L.: On Lovász' lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1-13 (1986)
5. Blömer, J.: Closest vectors, successive minima, and dual HKZ-bases of lattices. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 248-259. Springer, Heidelberg (2000)
6. Blömer, J., Seifert, J.-P.: The complexity of computing short linearly independent vectors and sort bases in a lattice. In: Proceedings of the 21th Symposium on Theory of Computing, pp. 711-720 (1999)
7. Dyer, M., Frieze, A., Kannan, R.: A random polynomial time algorithm for approximating the volume of convex bodies. Journal of the ACM 38(1), 1-17 (1991)
8. Dinur, I., Kindler, G., Raz, R., Safra, S.: Approximating CVP to within almost-polynomial factors in NP-hard. Combinatorica 23(2), 205-243 (2003)
9. Kannan, R.: Algorithmic geometry of numbers. Annual Reviews in Computer Science 2, 231-267 (1987)
10. Kannan, R.: Minkowski's convex body theorem and integer programming. Mathematics of Operations Research 12(3), 415-440 (1987)
11. Khot, S.: Hardness of approximating the shortest vector problem in lattices. Journal of the ACM (JACM) 52(5), 789-808 (2005)
12. Lenstra, A.K., Lenstra, H.W., Lovász, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261, 515-534 (1982)
13. Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems - A Cryptographic Perspective. Kluwer Academic Publishers, Dordrecht (2002)
14. Micciancio, D.: The shortest vector in a lattice is hard to approximate to within some constant. SIAM Journal on Computing 30(6), 2008-2035 (2000)
15. (n)-time algorithm for SVP (2004)
16. Schnorr, C.-P.: A hierarchy of polynomial time lattice basis reduction algorithms. Theoretical Computer Science 53, 201-224 (1987)
17. Schnorr, C.-P.: Block reduced lattice bases and successive minima. Combinatorics, Probability & Computing 3, 507-522 (1994)