. Bi, J. Jean-sébastien-coron, . Faugère, . Phongq, G. Nguyen et al., Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences, IACR Cryptology ePrint Archive, 2014.
DOI : 10.1007/978-3-642-54631-0_11
URL : https://hal.archives-ouvertes.fr/hal-00926902

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.
DOI : 10.1007/3-540-48910-X_1

D. Boneh, G. Durfee, and N. Howgrave-graham, Factoring N = p r q for Large r, Advances in Cryptology -Proc. CRYPTO '99, pp.326-337, 1999.
DOI : 10.1007/3-540-48405-1_21

J. Blömer and A. May, A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers, Advances in Cryptology -Proc. EUROCRYPT '05, pp.251-267, 2005.
DOI : 10.1007/11426639_15

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-165233, 1996.
DOI : 10.1007/3-540-68339-9_14

G. Durfee and P. Q. Nguyen, Cryptanalysis of the RSA schemes with short secret exponent from asiacrypt '99 [HG97] Nick Howgrave-Graham. Finding small roots of univariate modular equations revisited, Advances in Cryptology -ASIACRYPT 2000, 6th International Conference on the Theory and Application of Cryptology and Information Security Proceedings Cryptography and Coding ? Proc. IMA '97, pp.14-29, 1997.

E. Jochemsz and A. May, A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073, Advances in Cryptology -CRYPTO 2007, 27th Annual International Cryptology Conference ProceedingsLen87] H.W. Lenstra. Factoring integers with elliptic curves, pp.395-411649, 1987.
DOI : 10.1007/978-3-540-74143-5_22

S. Lim, S. Kim, I. Yie, and H. Lee, A generalized takagi-cryptosystem with a modulus of the form p r q s, Progress in Cryptology -INDOCRYPT 2000, First International Conference in Cryptology in India Proceedings, pp.283-294, 2000.

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, Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring, Advances in Cryptology -CRYPTO 2004, 24th Annual International CryptologyConference Proceedings, pp.213-219874, 2004.
DOI : 10.1007/978-3-540-28628-8_13

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, 2011.
DOI : 10.1145/1993636.1993691
URL : https://hal.archives-ouvertes.fr/ensl-00534899

T. Takagi, Fast RSA-type cryptosystems using n-adic expansion, Advances in Cryptology - CRYPTO '97 17th Annual International Cryptology Conference Proceedings, pp.372-384, 1997.
DOI : 10.1007/BFb0052249

T. Takagi, Fast RSA-type cryptosystem modulo p k q, Advances in Cryptology -CRYPTO '98, 18th Annual International Cryptology Conference Proceedings, pp.318-326, 1998.
DOI : 10.1007/BFb0055738