M. Ajtai, The shortest vector problem in L2 is NP-hard for randomized reductions, pp.10-19, 1998.

A. Akhavi, The optimal LLL algorithm is still polynomial in fixed dimension, Theoretical Computer Science, vol.297, issue.1-3, pp.1-3
DOI : 10.1016/S0304-3975(02)00616-3

K. Belabas, M. Van-hoeij, J. Klüners, and A. Steel, Factoring polynomials over global fields, preprint arXiv:math, pp.409510-409511, 2004.

C. Bright, Vector rational number reconstruction, Proceedings of the 36th international symposium on Symbolic and algebraic computation, ISSAC '11, 2009.
DOI : 10.1145/1993886.1993900

D. Coppersmith, Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities, Journal of Cryptology, vol.10, issue.4, pp.233-260, 1997.
DOI : 10.1007/s001459900030

J. Zur-gathen and J. Gerhard, Modern Computer Algebra, 1999.
DOI : 10.1017/CBO9781139856065

D. Goldstein and A. Mayer, On the equidistribution of Hecke points, Forum Mathematicum, vol.15, issue.2, pp.165-189, 2003.
DOI : 10.1515/form.2003.009

G. Hanrot, LLL: A Tool for Effective Diophantine Approximation, pp.81-118, 2007.
DOI : 10.1007/978-3-642-02295-1_6

URL : https://hal.archives-ouvertes.fr/inria-00187880

M. Van-hoeij, Factoring Polynomials and the Knapsack Problem, Journal of Number Theory, vol.95, issue.2, pp.167-189, 2002.
DOI : 10.1016/S0022-314X(01)92763-5

N. A. Howgrave-graham and N. P. Smart, Lattice attacks on digital signature schemes, Design, Codes and Cryptography, pp.283-290, 2001.

E. Kaltofen, On the complexity of finding short vectors in integer lattices, EUROCAL'83,LNCSv, pp.235-244

R. Kannan, A. K. Lenstra, and L. Lovász, Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers, pp.191-200, 1984.

A. K. Lenstra, H. W. Lenstra, J. , and L. Lovász, Factoring polynomials with rational coefficients, Mathematische Annalen, vol.32, issue.4, pp.515-534, 1982.
DOI : 10.1007/BF01457454

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.318

H. W. Lenstra, Flags and Lattice Basis Reduction, Euro. Cong. Math. v, vol.1, 2001.
DOI : 10.1007/978-3-0348-8268-2_3

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.492.2112

L. Lovász, An Algorithmic Theory of Numbers, Graphs and Convexity, 1986.
DOI : 10.1137/1.9781611970203

D. Micciancio, The Shortest Vector Problem is NP-hard to approximate to within some constant, pp.2008-2035, 2001.

P. Nguyen and D. Stehlé, Floating-Point LLL Revisited, Eurocrypt 2005, v. 3494 LNCS, pp.215-233
DOI : 10.1007/11426639_13

URL : https://hal.archives-ouvertes.fr/inria-00000377

A. Novocin, Factoring univariate polynomials over the rationals, ACM SIGSAM Bulletin, vol.42, issue.3, 2008.
DOI : 10.1145/1504347.1504365

A. Odlyzko, The rise and fall of knapsack cryptosystems, Crytology and Computational Number Theory, of Proc. of Symposia in Applied Mathematics, A.M.S, pp.75-88, 1990.

C. P. Schnorr, A more efficient algorithm for lattice basis reduction, Journal of Algorithms, vol.9, issue.1, pp.47-62, 1988.
DOI : 10.1016/0196-6774(88)90004-1

A. Schönhage, Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm, LNCS, vol.84, issue.172, pp.436-447
DOI : 10.1007/3-540-13345-3_40

D. Stehlé, Floating-Point LLL: Theoretical and Practical Aspects, pp.33-61, 2007.
DOI : 10.1007/978-3-642-02295-1_5

A. Storjohann and E. Zürich, Faster algorithms for integer lattice basis reduction