LLL on the average

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

Volumn 4076 LNCS, Issue , 2006, Pages 238-256

  Nguyen, Phong Q ^a   Stehlé, Damien ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; NUMBER THEORY; PROBLEM SOLVING;

LATTICE REDUCTION; PUZZLING STATEMENT; RUNNING TIME;

ALGORITHMS;

EID: 33746766947     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11792086_18     Document Type: Conference Paper

References (31)

1. M. Ajtai. Generating hard instances of lattice problems (extended abstract). In Proc. of STOC 1996, pages 99-108. ACM, 1996.
2. M. Ajtai. Random lattices and a conjectured 0-1 law about their polynomial time computable properties. In Proc. of FOCS 2002, pages 13-39. IEEE, 2002.
3. M. Ajtai. The worst-case behavior of Schnorr's algorithm approximating the shortest nonzero vector in a lattice. In Proc. of STOC 2003, pages 396-406. ACM, 2003.
4. M. Ajtai. Generating Random Lattices According to the Invariant Distribution. Draft, 2006.
5. L. Babai. On Lovász lattice reduction and the nearest lattice point problem. Combinatorica, 6:1-13, 1986.
6. W. Backes and S. Wetzel. Heuristics on lattice reduction in practice. ACM Journal of Experimental Algorithms, 7:1, 2002.
7. C. Batut, K. Belabas, D., Bernardi, H. Cohen, and M. Olivier. PARI/GP computer package version 2. Av. at http://pari.math.u-bordeaux.fr/.
8. J. W. S. Cassels. Rational quadratic forms, volume 13 of London Mathematical Society Monographs. Academic Press Inc. [Harcourt Brace Jovanovich Publishers], London, 1978.
9. H. Cohen. A Course in Computational Algebraic Number Theory, 2nd edition. Springer-V., 1995.
10. D. Coppersmith. Small solutions to polynomial equations, and low exponent RSA vulnerabilities. Journal of Cryptology, 10(4):233-260, 1997.
11. O. Goldreich, S. Goldwasser, and S. Halevi. Public-key cryptosystems from lattice reduction problems. In Proc. of Crypto 1997, volume 1294 of LNCS, pages 112-131. Springer-V., 1997.
12. D. Goldstein and A. Mayer. On the equidistribution of Hecke points. Forum Mathematicum, 15:165-189, 2003.
13. G. Golub and C. van Loan. Matrix Computations. J. Hopkins Univ. Press, 1996.
14. L. Groetschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-V., 1988.
15. C. Hermite. Extraits de lettres de M. Hermite à M. Jacobi sur différents objets de la théorie des nombres, deuxième lettre. Journal für die reine und angewandte Mathematik, 40:279-290, 1850.
16. J. Hoffstein, J. Pipher, and J. H. Silverman. NTRU: a ring based public key cryptosystem. In Proc. of ANTS III, volume 1423 of LNCS, pages 267-288. Springer-V., 1998.
17. H., Koy and C. P. Schnorr. Segment LLL-reduction of lattice bases with floating-point orthogonalization. In Proc. of CALC '01, volume 2146 of LNCS, pages 81-96. Springer-V., 2001.
18. A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász. Factoring polynomials with rational coefficients. Mathematische Annalen, 261:513-534, 1982.
19. H. W. Lenstra, Jr. Integer programming with a fixed number of variables. Technical report 81-03, Mathematisch Instituut, Universiteit van Amsterdam, 1981.
20. H. W. Lenstra, Jr. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8(4):538-548, 1983.
21. Magma. The Magma computational algebra system for algebra, number theory and geometry. Av. at http://www.maths.usyd.edu.an:8000/u/magma/.
22. D. Micciancio and S. Goldwasser. Complexity of lattice problems: a cryptographic perspective. Kluwer Academic Press, 2002.
23. P. Q. Nguyen and D. Stehlé. Floating-point LLL revisited. In Proc. of Eurocrypt 2005, volume 3494 of LNCS, pages 215-233. Springer-V., 2005.
24. P. Q. Nguyen and J. Stern. The two faces of lattices in cryptology. In Proc. of CALC '01, volume 2146 of LNCS, pages 146-180. Springer-V., 2001.
25. A. M. Odlyzko. The rise and fall of knapsack cryptosystems. In Proc. of Cryptology and Computational Number Theory, volume 42 of Proc. of Symposia in Applied Mathematics, pages 75-88. AMS, 1989.
26. The SPACES Project. MPFR, a LGPL-library for multiple-precision floating-point computations with exact rounding. Av. at http://www.mpfr.org/.
27. C. P. Schnorr. A hierarchy of polynomial lattice basis reduction algorithms. Theoretical Computer Science, 53:201-224, 1987.
28. C. P. Schnorr. A more efficient algorithm for lattice basis reduction. Journal of Algorithms, 9(1):47-62, 1988.
29. C. P. Schnorr and M. Euchner. Lattice basis reduction: improved practical algorithms and solving subset sum problems. Mathematics of Programming, 66:181-199, 1994.
30. V. Shoup. NTL, Number Theory Library. Av. at http://www.shoup.net/ntl/.
31. C. L. Siegel. A mean value theorem in geometry of numbers. Annals of Mathematics, 46(2):340-347, 1945.