J. Abbott, V. Shoup, and P. Zimmermann, Factorization in Z[x], Proceedings of the 2000 international symposium on Symbolic and algebraic computation symbolic and algebraic computation , ISSAC '00, pp.1-7, 2000.
DOI : 10.1145/345542.345560

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

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

K. Belabas, M. Van-hoeij, J. Klüners, and A. Steel, 3 The power hack is an attempt to detect structure of the form g(x k ) in f so that smaller polynomials can be reduced in some cases. Factoring polynomials over global fields, preprint arXiv:math, pp.409510-409511, 2004.

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

W. Hart and F. , open-source C-library

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

M. Van-hoeij and A. Novocin, Gradual sub-lattice reduction and a new complexity for factoring polynomials, accepted for proceedings of, 2010.

E. Kaltofen, Polynomial factorization, Proceedings of the 2003 international symposium on Symbolic and algebraic computation , ISSAC '03, pp.95-113, 1982.
DOI : 10.1145/860854.860857

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

E. Kaltofen, D. R. Musser, and B. D. , A Generalized Class of Polynomials that are Hard to Factor, SIAM Journal on Computing, vol.12, issue.3, pp.473-485, 1983.
DOI : 10.1137/0212031

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

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

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

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

V. Shoup and N. , open-source C++ library

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

H. Zassenhaus, On Hensel factorization, I, Journal of Number Theory, vol.1, issue.3, pp.291-311, 1969.
DOI : 10.1016/0022-314X(69)90047-X