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, pp.1339-1349, 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?CRYPTO'99, pp.787-787, 1999.
DOI : 10.1007/3-540-48405-1_21

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

M. Herrmann and A. May, Solving linear equations modulo divisors: On factoring given any bits Advances in Cryptology-ASIACRYPT, pp.406-424, 2008.

M. Herrmann and A. May, Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA, pp.53-69, 2010.
DOI : 10.1007/978-3-642-13013-7_4

N. Howgrave-graham, Finding small roots of univariate modular equations revisited . Crytography and Coding, pp.131-142, 1997.

K. Itoh, N. Kunihiro, and K. Kurosawa, Small Secret Key Attack on a Variant of RSA (Due to Takagi), Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology, pp.387-406, 2008.
DOI : 10.1007/978-3-540-79263-5_25

N. Kunihiro, N. Shinohara, and T. Izu, A unified framework for small secret exponent attack on RSA, Selected Areas in Cryptography, pp.260-277, 2012.

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

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, pp.283-294, 2000.

Y. Lu, R. Zhang, and D. Lin, Factoring Multi-power RSA Modulus N???=???p r q with Partial Known Bits, Information Security and Privacy, pp.57-71, 2013.
DOI : 10.1007/978-3-642-39059-3_5

Y. Lu, R. Zhang, and D. Lin, New results on solving linear equations modulo unknown divisors and its applications, 2014.

A. May, Secret exponent attacks on RSA-type schemes with moduli N = p r q. Public Key Cryptography?PKC, pp.218-230, 2004.

T. Okamoto and S. Uchiyama, A new public-key cryptosystem as secure as factoring, Advances in Cryptography?Eurocrypt'98, pp.308-318, 1998.
DOI : 10.1007/BFb0054135

R. Rivest and A. Shamir, Efficient Factoring Based on Partial Information, Advances in Cryptology?EUROCRYPT'85, pp.31-34, 1986.
DOI : 10.1007/3-540-39805-8_3

S. Sarkar, Small secret exponent attack on RSA variant with modulus N = p r q. Designs, Codes and Cryptography, pp.1-10, 2014.

T. Takagi, Fast RSA-type cryptosystem modulo p k q, Advances in Cryptology? Crypto'98, pp.318-326, 1998.
DOI : 10.1007/BFb0055738

M. J. Wiener, Cryptanalysis of short RSA secret exponents, IEEE Transactions on Information Theory, vol.36, issue.3, pp.553-558, 1990.
DOI : 10.1109/18.54902