X. Ansi-standard, Digital Signatures Using Reversible Public Key Cryptography for the Financial Services Industry (rDSA), pp.31-1998

D. J. Bernstein, Y. A. Chang, C. M. Cheng, L. P. Chou, N. Heninger et al., Factoring RSA keys from certified smart cards: Coppersmith in the wild, Advances in Cryptology-ASIACRYPT 2013, pp.341-360, 2013.

D. Boneh, Twenty years of attacks on the RSA cryptosystem, Notices Amer. Math. Soc, vol.46, issue.2, pp.203-213, 1999.

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.

, 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.

J. Hastad, On Using RSA with Low Exponent in a Public Key Network, in Proceedings of CRYPTO, vol.85, pp.403-408, 1986.

J. Hastad, Solving simultaneous modular equations of low degree, SIAM J. of Computing, vol.17, pp.336-341, 1988.

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

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, Y. Zhang, R. Lin, and D. , New Results on Solving Linear Equations Modulo Unknown Divisors and its Applications, Cryptology ePrint Archive, vol.343, 2014.

A. May, New RSA Vulnerabilities Using Lattice Reduction Methods, 2003.

A. Nitaj, Another generalization of Wieners attack on RSA, Africacrypt 2008, vol.5023, pp.174-190, 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.

P. Zimmermann, 50 largest factors found by ECM

B. De-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.