R. , .. D. Boneh, and G. Durfee, Cryptanalysis of RSA with private key d less than N 0.292, IEEE Transactions on Information Theory, vol.46, issue.4, p.1339, 2000.

J. Buchmann, Reducing lattice bases by means of approximations, Algorithmic Number Theory ? Proc. ANTS-I, pp.160-168, 1994.
DOI : 10.1007/3-540-58691-1_54

D. Cadé, X. Pujol, and D. Stehlé, FPLLL library, version 3.0. Available from http, 2008.

H. Cohen, A course in computational algebraic number theory, Graduate Texts in Mathematics, vol.138, 1993.
DOI : 10.1007/978-3-662-02945-9

H. Cohn and N. Heninger, Approximate common divisors via lattices, The Open Book Series, vol.1, issue.1, p.437, 2011.
DOI : 10.2140/obs.2013.1.271

D. Coppersmith, Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known, Advances in Cryptology -Proc. EUROCRYPT '96, pp.178-189, 1996.
DOI : 10.1007/3-540-68339-9_16

D. Coppersmith, Finding a Small Root of a Univariate Modular Equation, Advances in Cryptology -Proc. EUROCRYPT '96, pp.155-165, 1996.
DOI : 10.1007/3-540-68339-9_14

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.4806

J. Coron, Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach, Advances in Cryptology ? Proc. CRYPTO '07, pp.379-394, 2007.
DOI : 10.1007/978-3-540-74143-5_21

C. Coupé, P. Q. Nguyen, and J. Stern, The Effectiveness of Lattice Attacks Against Low-Exponent RSA, Public Key Cryptography ? Proc. PKC '99, pp.204-218, 1999.
DOI : 10.1007/3-540-49162-7_16

H. Daudé and B. Vallée, An upper bound on the average number of iterations of the LLL algorithm, Theoretical Computer Science, vol.123, issue.1, pp.95-115, 1994.
DOI : 10.1016/0304-3975(94)90071-X

N. Howgrave-graham, Finding small roots of univariate modular equations revisited, Cryptography and Coding ? Proc. IMA '97, pp.131-142, 1997.
DOI : 10.1007/BFb0024458

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

A. May, Using LLL-Reduction for Solving RSA and Factorization Problems, 2010.
DOI : 10.1007/978-3-642-02295-1_10

H. Najafi, M. Jafari, and M. Damen, On Adaptive Lattice Reduction over Correlated Fading Channels, IEEE Transactions on Communications, vol.59, issue.5, pp.1224-1227, 2011.
DOI : 10.1109/TCOMM.2011.022811.090576

P. Q. Nguyen, Public-key cryptanalysis, Recent Trends in Cryptography, 2009.
DOI : 10.1090/conm/477/09304

P. Q. Nguyen and D. Stehlé, LLL on the Average, Algorithmic Number Theory ? Proc. ANTS, LNCS, pp.238-256, 2006.
DOI : 10.1007/11792086_18
URL : https://hal.archives-ouvertes.fr/hal-00107309

P. Q. Nguyen and D. Stehlé, An LLL Algorithm with Quadratic Complexity, SIAM Journal on Computing, vol.39, issue.3, pp.874-903, 2009.
DOI : 10.1137/070705702
URL : https://hal.archives-ouvertes.fr/hal-00550981

A. Novocin, D. Stehlé, and G. Villard, An LLL-reduction algorithm with quasi-linear time complexity, Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pp.403-412
DOI : 10.1145/1993636.1993691
URL : https://hal.archives-ouvertes.fr/ensl-00534899

V. Shoup, OAEP Reconsidered, Journal of Cryptology, vol.15, issue.4, pp.223-249, 2002.
DOI : 10.1007/s00145-002-0133-9