J. Blömer and A. May, A generalized Wiener attack on RSA, Public Key Cryptography -PKC, vol.2947, pp.1-13, 2004.

D. Boneh and G. Durfee, Cryptanalysis of RSA with private key d less than N 0, Advances in Cryptology-Eurocrypt'99, vol.292, pp.1-11, 1999.

D. Boneh, G. Durfee, and N. Howgrave-graham, Factoring N = p r q for Large r, Proceedings of Crypto'99, vol.1666, pp.326-337, 1999.

, Cryptography using Compaq multiprime technology in a parallel processing environment, 2002.

D. Coppersmith, Small solutions to polynomial equations, and low exponent RSA vulnerabilities, Journal of Cryptology, vol.10, issue.4, pp.233-260, 1997.

G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 1975.

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

M. J. Hinek, Cryptanalysis of RSA and its variants. Chapman & Hall/CRC Cryptography and Network Security, 2010.

H. Lenstra, Factoring integers with elliptic curves, Annals of Mathematics, vol.126, pp.649-673, 1987.

A. K. Lenstra and H. W. Lenstra, The Development of the Number Field Sieve, vol.1554, 1993.

A. K. Lenstra, H. W. Lenstra, and L. Lovász, Factoring polynomials with rational coefficients, vol.261, pp.513-534, 1982.

Y. Lu, R. Zhang, and D. Lin, New Results on Solving Linear Equations Modulo Unknown Divisors and its Applications, Cryptology ePrint Archive, vol.343, 2014.

A. May, Secret Exponent Attacks on RSA-type Schemes with Moduli N = p r q. Public Key Cryptography-PKC 2004, vol.2947, pp.218-230, 2004.

A. May, Using LLL-reduction for solving RSA and factorization problems: a survey, LLL+25 Conference in Honour of the 25th Birthday of the LLL Algorithm, 2007.

R. Rivest, A. Shamir, and L. Adleman, A Method for Obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, issue.2, pp.120-126, 1978.

S. Sarkar, Small secret exponent attack on RSA variant with modulus N = p r q, Designs, Codes and Cryptography, vol.73, pp.383-392, 2015.

T. Takagi, Fast RSA-type cryptosystem modulo p k q, Advances in Cryptology-Crypto'98, pp.318-326, 1998.

M. Wiener, Cryptanalysis of short RSA secret exponents, IEEE Transactions on Information Theory, vol.36, pp.553-558, 1990.