Sieve algorithms for the shortest vector problem are practical

Journal of Mathematical Cryptology

Volumn 2, Issue 2, 2008, Pages 181-207

  Nguyen, Phong Q ^a   Vidick, Thomas ^b  

^a ENS   (France)

^b NONE

Author keywords

AKS Algorithm; Enumeration; Lattices; LLL; Sieve

Indexed keywords

EID: 57049145514     PISSN: 18622976     EISSN: 18622984     Source Type: Journal    
DOI: 10.1515/JMC.2008.009     Document Type: Article

References (34)

1. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, Closest point search in lattices, IEEE Trans. Inform. Theory 48 (2002), pp. 2201-2214. (Pubitemid 35017061)
2. M. Ajtai, Generating Random Lattices according to the Invariant Distribution, Draft of March 2006.
3. 2 is NP-hard for Randomized Reductions. Proc. of 30th STOC. ACM, 1998, Available at as TR97-047.
4. M. Ajtai, R. Kumar, and D. Sivakumar, A sieve algorithm for the shortest lattice vector problem. Proc. 33rd STOC, pp. 601-610, ACM, 2001. (Pubitemid 32865777)
5. A. Andoni and P. Indyk, Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. FOCS '06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp. 459-468. IEEE Computer Society, Washington, DC, USA, 2006. (Pubitemid 351175534)
6. L. Babai, On Lovász lattice reduction and the nearest lattice point problem, Combinatorica 6 (1986), pp. 1-13.
7. K. Böröczky and G. Wintsche, Covering the sphere by equal spherical balls. Discrete and Computational Geometry, The Goodman-Pollack Festschrift, pp. 237-253, 2003.
8. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. Springer-Verlag, 1998, Third edition.
9. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, Locality-sensitive hashing scheme based on p-stable distributions. SCG '04: Proceedings of the twentieth annual symposium on Computational geometry, pp. 253-262. ACM Press, New York, NY, USA, 2004.
10. ECCC, http://www.eccc.uni-trier.de/eccc/, The Electronic Colloquium on Computational Complexity.
11. U. Fincke and M. Pohst, Improved methods for calculating vectors of short length in a lattice, including a complexity analysis, Math. Comp. 44 (1985), pp. 463-471.
12. N. Gama, N. Howgrave-Graham, H. Koy, and P. Q. Nguyen, Rankin's Constant and Blockwise Lattice Reduction. Proc. CRYPTO '06, Lecture Notes in Computer Science 4117, pp. 112-130. Springer, 2006. (Pubitemid 44532112)
13. N. Gama and P. Q. Nguyen, Finding Short Lattice Vectors within Mordell's Inequality. STOC '08- Proc. 40th ACM Symposium on the Theory of Computing. ACM, 2008.
14. -, Predicting Lattice Reduction. Advances in Cryptology - Proc. EUROCRYPT '08, Lecture Notes in Computer Science. Springer, 2008.
15. C. Gentry, C. Peikert, and V. Vaikuntanathan, Trapdoors for Hard Lattices and New Cryptographic Constructions, Cryptology ePrint Archive, Report 2007/432, 2007, To appear in STOC '08.
16. D. Goldstein and A. Mayer, On the equidistribution of Hecke points, Forum Math. 15 (2003), pp. 165-189. (Pubitemid 36932024)
17. M. Gruber and C. G. Lekkerkerker, Geometry of Numbers. North-Holland, 1987.
18. G. Hanrot and D. Stehlé, Improved Analysis of Kannan's Shortest Lattice Vector Algorithm. Advances in Cryptology - Proc. CRYPTO 2007, Lecture Notes in Computer Science 4622, pp. 170-186. Springer, 2007.
19. -, Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases, CoRR abs/0801.3331 (2008).
20. B. Helfrich, Algorithms to construct Minkowski reduced and Hermite reduced bases, Theoretical Computer Science 41 (1985), pp. 125-139. (Pubitemid 16593835)
21. R. Kannan, Improved algorithms for integer programming and related lattice problems. Proc. of 15th STOC, pp. 193-206. ACM, 1983. (Pubitemid 14522551)
22. P. Klein, Finding the Closest Lattice Vector when It's Unusually Close. Proc. of SODA '00, ACM-SIAM, 2000.
23. A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász, Factoring polynomials with rational coefficients, Mathematische Ann. 261 (1982), pp. 513-534.
24. D. Micciancio and S. Goldwasser, Complexity of lattice problems, The Kluwer International Series in Engineering and Computer Science, 671. Kluwer Academic Publishers, Boston, MA, 2002, A cryptographic perspective. MR MR2042139 (2004m:94067)
25. P. Q. Nguyen and D. Stehlé, LLL on the Average. Proc. of the 7th International Algorithmic Number Theory Symposium, (ANTS-VII), LNCS 4076, pp. 238-256. Springer-Verlag, 2006.
26. P. Q. Nguyen and J. Stern, The Two Faces of Lattices in Cryptology. Proc. of CALC '01, LNCS 2146. Springer-Verlag, 2001.
27. C. Peikert and B. Waters, Lossy Trapdoor Functions and Their Applications, Cryptology ePrint Archive, Report, 2007. Report 2007/279. To appear in STOC '08.
28. M. Pohst, On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications, ACM SIGSAM Bulletin 15 (1981), pp. 37-44.
29. O. Regev, Lecture notes on lattices in computer science, 2004.
30. C. A. Rogers, Lattice coverings of space, Mathematika 6 (1959), pp. 33-39.
31. C.-P. Schnorr, A hierarchy of polynomial lattice basis reduction algorithms, Theoretical Computer Science 53 (1987), pp. 201-224.
32. -, Lattice reduction by random sampling and birthday methods, Proc. STACS 2003, Lecture Notes in Comput. Sci. 2607, Springer, Berlin, 2003, pp. 145-156.
33. C.-P. Schnorr and M. Euchner, Lattice basis reduction: improved practical algorithms and solving subset sum problems, Math. Programming 66 (1994), pp. 181-199.
34. V. Shoup, Number Theory C++ Library (NTL) version 5.4, Available at http://www. shoup.net/ntl/.