Generating hard instances of lattice problems (extended abstract), Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , STOC '96, pp.99-108, 1996. ,
DOI : 10.1145/237814.237838
-hard for randomized reductions (extended abstract), Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, 1998. ,
DOI : 10.1145/276698.276705
Worst-Case Complexity of the Optimal LLL Algorithm, Proceedings of the, 2000. ,
DOI : 10.1007/10719839_35
Another View of the Gaussian Algorithm, Proceedings of the 2004 Latin American Theoretical Informatics, pp.474-487, 2004. ,
DOI : 10.1007/978-3-540-24698-5_51
URL : https://hal.archives-ouvertes.fr/hal-00159666
On Lov??sz??? lattice reduction and the nearest lattice point problem, Combinatorica, vol.357, issue.1, pp.1-13, 1986. ,
DOI : 10.1007/BF02579403
An Introduction to the Geometry of Numbers, 1971. ,
DOI : 10.1007/978-3-642-62035-5
Sphere Packings, Lattices and Groups, 1988. ,
Theory of stereohedra, Trudy Mathematics Institute Steklov, vol.64, pp.28-51, 1961. ,
Fast Reduction of Ternary Quadratic Forms, Proceedings of the 2001 Cryptography and Lattices Conference (CALC'01, pp.32-44, 2001. ,
DOI : 10.1007/3-540-44670-2_4
Finding short lattice vectors within mordell's inequality, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, 2008. ,
DOI : 10.1145/1374376.1374408
Disquisitiones Arithmeticae, 1801. ,
Algorithms to construct minkowski reduced and hermite reduced lattice bases, Theoretical Computer Science, vol.41, pp.125-139, 1985. ,
DOI : 10.1016/0304-3975(85)90067-2
URL : http://doi.org/10.1016/0304-3975(85)90067-2
Extraits de lettres de M. Hermitè a M. Jacobi sur différents objets de la théorie des nombres,deuxì eme lettre, Journal für die reine und angewandte Mathematik, pp.279-290, 1850. ,
The Generalized Gauss Reduction Algorithm, Journal of Algorithms, vol.21, issue.3, pp.565-578, 1996. ,
DOI : 10.1006/jagm.1996.0059
Improved algorithms for integer programming and related lattice problems, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, pp.99-108, 1983. ,
DOI : 10.1145/800061.808749
Sur les formes quadratiques, Mathematische Annalen, vol.6, issue.3, pp.336-389, 1873. ,
DOI : 10.1007/BF01442795
Worst-case complexity bounds for algorithms in the theory of integral quadratic forms, Journal of Algorithms, vol.1, issue.2, pp.142-186, 1980. ,
DOI : 10.1016/0196-6774(80)90021-8
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice, Combinatorica, vol.96, issue.4 (208), pp.333-348, 1990. ,
DOI : 10.1007/BF02128669
Factoring polynomials with rational coefficients, Mathematische Annalen, vol.32, issue.4, pp.513-534, 1982. ,
DOI : 10.1007/BF01457454
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.318
Perfect Lattices in Euclidean Spaces, 2002. ,
DOI : 10.1007/978-3-662-05167-2
Complexity of lattice problems : a cryptographic perspective, 2002. ,
DOI : 10.1007/978-1-4615-0897-7
Geometrie der Zahlen, 1896. ,
Low-dimensional lattice basis reduction revisited (extended abstract), Proceedings of the 6th Algorithmic Number Theory Symposium (ANTS VI), 2004. ,
DOI : 10.1145/1597036.1597050
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.214.5508
Floating-Point LLL Revisited, Proceedings of Eurocrypt 2005, pp.215-233, 2005. ,
DOI : 10.1007/11426639_13
URL : https://hal.archives-ouvertes.fr/inria-00000377
The Two Faces of Lattices in Cryptology, Proceedings of the 2001 Cryptography and Lattices Conference (CALC'01, pp.146-180, 2001. ,
DOI : 10.1007/3-540-44670-2_12
On Hermite, Minkowski and Venkov reduction of positive quadratic forms in n variables, Soviet Mathematics Doklady, vol.13, pp.1676-1679, 1972. ,
A hierarchy of polynomial time lattice basis reduction algorithms, Theoretical Computer Science, vol.53, issue.2-3, pp.201-224, 1987. ,
DOI : 10.1016/0304-3975(87)90064-8
Lattice basis reduction: Improved practical algorithms and solving subset sum problems, Mathematical Programming, vol.13, issue.1, pp.181-199, 1994. ,
DOI : 10.1007/BF01581144
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.3331
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction, Proceedings of Eurocrypt 1995, pp.1-12, 1995. ,
DOI : 10.1007/3-540-49264-X_1
Fast multiplication of large numbers, Computing, vol.150, issue.3-4, pp.281-292, 1971. ,
DOI : 10.1007/BF02242355
A 3-Dimensional Lattice Reduction Algorithm, Proceedings of the 2001 Cryptography and Lattices Conference (CALC'01, pp.181-193, 2001. ,
DOI : 10.1007/3-540-44670-2_13
Lectures on the Geometry of Numbers, 1989. ,
DOI : 10.1007/978-3-662-08287-4
Regular Dirichlet-Vorono¨?Vorono¨? partitions for the second triclinic group, English translation of the proceedings of the Steklov Institute of Mathematics, p.123, 1973. ,
Reduction theory of positive quadratic forms, Journal of Soviet Mathematics, vol.96, issue.2, pp.651-655, 1973. ,
DOI : 10.1007/BF01117520
Une approche géométrique de la réduction des réseaux en petite dimension, 1986. ,
Gauss' algorithm revisited, Journal of Algorithms, vol.12, issue.4, pp.556-572, 1991. ,
DOI : 10.1016/0196-6774(91)90033-U
Nouvelles applications des paramètres continusàcontinus`continusà la théorie des formes quadratiques, Journal für die reine und angewandte Mathematik, vol.134, pp.198-287, 1908. ,
Die Reduktionstheorie der positiven quadratischen Formen, Acta Mathematica, vol.96, pp.265-309, 1956. ,
DOI : 10.1007/978-3-0348-6925-6_3