Faster exponential time algorithms for the shortest vector problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 1468-1480

  Micciancio, Daniele ^a   Voulgaris, Panagiotis ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithm analysis; Cryptography; Shortest vector problem; Sieving algorithms; Software implementations

Indexed keywords

CRYPTOGRAPHY; VECTORS;

ALGORITHM ANALYSIS; EXACT SOLUTION; EXPONENTIAL TIME ALGORITHM; RUNNING TIME; SHORTEST VECTOR PROBLEM; SOFTWARE IMPLEMENTATION; SPACE COMPLEXITY; UPPER BOUND;

VECTOR SPACES;

EID: 77951698499     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.119     Document Type: Conference Paper

References (30)

1. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger. Closest point search in lattices. IEEE Transactions on Information Theory, 48(8):2201-2214, Aug. 2002.
2. M. Ajtai. Generating hard instances of lattice problems. Complexity of Computations and Proofs, Quaderni di Matematica, 13:1-32, 2004. Preliminary version in STOC 1996.
3. M. Ajtai and C. Dwork. A public-key cryptosystem with worst-case/average-case equivalence. In Proceedings of STOC '97, pages 284-293. ACM, May 1997.
4. M. Ajtai, R. Kumar, and D. Sivakumar. A sieve algorithm for the shortest lattice vector problem. In Proceedings of STOC '01, pages 266-275. ACM, July 2001.
5. J. Conway and N. Sloane. Sphere Packings, Lattices and Groups. Springer, 1999.
6. C. Dwork. Positive applications of lattices to cryptography. In I. Prívara and P. Ruzicka, editors, Mathematical Foundations of Computer Science 1997, volume 1295 of LNCS, pages 44-51. Springer, Aug. 1997.
7. N. Gama and P. Q. Nguyen. Finding short lattice vectors within mordell's inequality. In Proceedings of STOC '08, pages 207-216. ACM, May 2008.
8. N. Gama and P. Q. Nguyen. Predicting lattice reduction. In Proceedings of EUROCRYPT '08, volume 4965 of LNCS, pages 31-51. Springer, 2008.
9. C. Gentry, C. Peikert, and V. Vaikuntanathan. Trapdoors for hard lattices and new cryptographic constructions. In Proceedings of STOC '08, pages 197-206. ACM, May 2008.
10. G. Hanrot and D. Stehlé. Improved Analysis of Kannan's Shortest Lattice Vector Algorithm. In Proceedings of Crypto '07.
11. J. Hoffstein, J. Pipher, and J. H. Silverman. NTRU: a ring based public key cryptosystem. In Proceedings of ANTS-III, volume 1423 of LNCS, pages 267-288. Springer, June 1998.
12. G. Kabatiansky and V. Levenshtein. Bounds for packings on a sphere and in space. Problemy Peredachi Informatsii, 14(1):3-25, 1978.
13. R. Kannan. Improved algorithms for integer programming and related lattice problems. In Proceedings of the fifteenth annual ACM symposium on theory of computing - STOC '83, pages 193-206. ACM, Apr. 1983.
14. R. Kannan. Annual Review of Computer Science, volume 2, chapter Algorithmic Geometry of numbers, pages 231-267. Annual Review Inc., Palo Alto, California, 1987.
15. P. Klein. Finding the closest lattice vector when it's unusually close. In Proceedings of the 11th symposium on discrete algorithms, San Francisco, California, Jan. 2000. SIAM.
16. A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász. Factoring polynomials with rational coefficients. Mathematische Annalen, 261:513-534, 1982.
17. D. Micciancio. Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Computational Complexity, 16(4):365-411, Dec. 2007. Preliminary version in FOCS 2002.
18. D. Micciancio and S. Goldwasser. Complexity of Lattice Problems: a cryptographic perspective, volume 671 of The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston, Massachusetts, Mar. 2002.
19. D. Micciancio and O. Regev. Worst-case to average-case reductions based on Gaussian measure. SIAM Journal on Computing, 37(1):267-302, 2007. Preliminary version in FOCS 2004.
20. P. Nguyen and J. Stern. The two faces of lattices in cryptology. In Proceedings of CaLC '01, volume 2146 of LNCS, pages 146-180. Springer, Mar. 2001.
21. P. Nguyen and T. Vidick. Sieve algorithms for the shortest vector problem are practical. J. of Mathematical Cryptology, 2(2):181-207, Jul 2008.
22. C. Peikert and B. Waters. Lossy trapdoor functions and their applications. In Proceedings of STOC '08, pages 187-196. ACM, May 2008.
23. M. Pohst. On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications. ACM SIGSAM Bulletin, 15(1):37-44, 1981.
24. X. Pujol and D. Stehlé. Rigorous and efficient short lattice vectors enumeration, 2008. In Proceedings of Asiacrypt '08, pages 390-405. Springer, 2008.
25. O. Regev. New lattice based cryptographic constructions. Journal of the ACM, 51(6):899-942, 2004. Preliminary version in STOC 2003.
26. O. Regev. On lattices, learning with errors, random linear codes, and cryptography. In Proceedings of STOC '05, pages 84-93. ACM, June 2005.
27. O. Regev. Lecture notes on lattices in computer science, 2004. Available at http://www.cs.tau.ac.il/odedr/teaching/lattices-fall-2004/index.html.
28. C.-P. Schnorr. A hierarchy of polynomial time lattice basis reduction algorithms. Theoretical Computer Science, 53(2-3):201-224, 1987.
29. C.-P. Schnorr and M. Euchner. Lattice basis reduction: Improved practical algorithms and solving subset sum problems. Mathematical programming, 66(1-3):181-199, Aug. 1994. Preliminary version in FCT 1991.
30. V. Shoup. NTL: A library for doing number theory, 2003.