O. Baudron, D. Pointcheval, and J. Stern, Extended Notions of Security for Multicast Public Key Cryptosystems, Automata, Language and Programming, lncs, pp.499-511, 2000.
DOI : 10.1007/3-540-45022-X_42

M. Bellare, A. Boldyreva, and S. Micali, Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements, Proceedings of Eurocrypt 2000, lncs, pp.259-274, 2000.
DOI : 10.1007/3-540-45539-6_18

M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway, Relations among notions of security for public-key encryption schemes, Proceedings of Crypto 1998, lncs, pp.549-570, 1998.
DOI : 10.1007/BFb0055718

D. Bleichenbacher, Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1, Proceedings of Crypto 1998, lncs, pp.1-12, 1998.
DOI : 10.1007/BFb0055716

D. Coppersmith, Finding a Small Root of a Univariate Modular Equation, Proceedings of Eurocrypt 1996, lncs, pp.155-165, 1996.
DOI : 10.1007/3-540-68339-9_14

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.4806

Y. Desmedt and A. M. Odlyzko, A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes, Proceedings of Crypto 1985, lncs, pp.516-522, 1985.
DOI : 10.1007/3-540-39799-X_40

J. Coron, D. Naccache, M. Joye, and P. Paillier, New Attacks on PKCS#1 v1.5 Encryption, Proceedings of Eurocrypt 2000, lncs, pp.369-381, 2000.
DOI : 10.1007/3-540-45539-6_25

J. Coron, D. Naccache, M. Joye, and P. Paillier, Universal Padding Schemes for RSA, Proceedings of Crypto 2002, lncs, pp.226-241, 2002.
DOI : 10.1007/3-540-45708-9_15

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.7968

E. Fujisaki, T. Okamoto, D. Pointcheval, and J. Stern, RSA-OAEP Is Secure under the RSA Assumption, Journal of Cryptology, vol.17, issue.2, pp.81-104, 2004.
DOI : 10.1007/s00145-002-0204-y

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.7519

J. Håstad, Solving simultaneous modular equations of low degree, siam, siam, pp.336-341, 1988.

N. Howgrave-graham, Finding small roots of univariate modular equations revisited, Proceedings of Cryptography and Coding, lncs, pp.131-142, 1997.
DOI : 10.1007/BFb0024458

E. Jochemsz and A. , A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants, Proceedings of Asiacrypt 2006, lncs, pp.267-282, 2006.
DOI : 10.1007/11935230_18

B. Kaliski, pkcs#1: rsa Encryption Standard, Version 1.5, rsa Laboratories, 1993.
DOI : 10.17487/rfc2313

B. Kaliski, pkcs#1: rsa Encryption Standard, Version 2.0, rsa Laboratories, 1998.
DOI : 10.17487/rfc2313

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.318

R. L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, acm, pp.120-126, 1978.
DOI : 10.1145/359340.359342