H. Bahig, A. Bhery, and D. Nassr, Cryptanalysis of multi-prime RSA with small prime difference, Information and Communications Security -14th International Conference, ICICS 2012, vol.7618, p.334, 2012.

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

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

A. Dujella, Continued fractions and RSA with small secret exponent, Tatra Mt. Math. Publ, vol.29, pp.101-112, 2004.

M. J. Hinek, Cryptanalysis of RSA and its variants, 2010.

M. J. Hinek, M. K. Low, and E. Teske, On Some Attacks on Multi-prime RSA, SAC 2002, vol.2595, p.385404, 2003.

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

E. Jochemsz and A. May, A strategy for finding roots of multivariate polynomials with new applications in attacking RSA variants, ASIACRYPT 2006, vol.4284, pp.267-282, 2006.

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

S. Maitra and S. Sarkar, Revisiting Wiener's Attack -New Weak Keys in RSA, 11th Information Security Conference, pp.228-243, 2008.

A. May, New RSA Vulnerabilities using Lattics Reduction Methods, Ph.D. Dissertation. University of Paderborn, 2003.

A. Nitaj, Another generalization of Wieners attack on RSA, Africacrypt 2008, vol.5023, p.174190, 2008.

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.

R. Steinfeld and Y. Zheng, On the Security of RSA with Primes Sharing Least-Significant Bits, Appl. Algebra Eng. Commun. Comput, vol.15, issue.3-4, p.179200, 2004.

M. Herrmann and A. May, Maximizing small root bounds by linearization and applications to small secret exponent RSA, 2010.

S. Sarkar, S. Maitra, and S. Sarkar, RSA cryptanalysis with increased bounds on the secret exponent using less lattice dimension, IACR Cryptology ePrint Archive, 2008.

H. Sun, R. Mu-enwu, J. Steinfeld, H. Guo, and . Wang, Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits, CANS 2008, vol.5339, pp.49-63, 2008.

A. Takayasu and N. Kunihiro, General bounds for small inverse problems and its applications to multi-prime RSA, Proc. ICISC 2014, vol.8949, p.317, 2014.

B. Weger, Cryptanalysis of RSA with small prime difference, Applicable Algebra in Engineering, Communication and Computing, vol.13, issue.1, pp.17-28, 2002.

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

H. Zhang and T. Takagi, Attacks on Multi-Prime RSA with Small prime Difference, ACISP 2013, vol.7959, pp.41-56, 2013.

H. Zhang and T. Takagi, Improved attacks on multi-prime RSA with small prime difference, IEICE Transactions 97-A, issue.7, p.15331541, 2014.