G. Barthe, B. Grégoire, Y. Lakhnech, and S. Z. Béguelin, Beyond Provable Security Verifiable IND-CCA Security of OAEP, Lecture Notes in Computer Science, vol.21, issue.2, pp.180-196, 2011.
DOI : 10.1109/SP.2009.17
URL : https://hal.archives-ouvertes.fr/hal-01112084

A. Bauer, J. Coron, D. Naccache, M. Tibouchi, and D. Vergnaud, On the Broadcast and Validity-Checking Security of pkcs#1 v1.5 Encryption, ACNS, pp.1-18, 2010.
DOI : 10.1007/978-3-642-13708-2_1
URL : https://hal.archives-ouvertes.fr/inria-00577142

M. Bellare and P. Rogaway, Random oracles are practical, Proceedings of the 1st ACM conference on Computer and communications security , CCS '93, pp.62-73, 1993.
DOI : 10.1145/168588.168596

M. Bellare and P. Rogaway, Optimal asymmetric encryption, Lecture Notes in Computer Science, vol.950, pp.92-111, 1994.
DOI : 10.1007/BFb0053428

M. Bellare and P. Rogaway, The Exact Security of Digital Signatures-How to Sign with RSA and Rabin, Lecture Notes in Computer Science, vol.1070, pp.399-416, 1996.
DOI : 10.1007/3-540-68339-9_34

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

L. Blum, M. Blum, and M. Shub, A Simple Unpredictable Pseudo-Random Number Generator, SIAM Journal on Computing, vol.15, issue.2, pp.364-383, 1986.
DOI : 10.1137/0215025

D. Boneh and R. Venkatesan, Breaking RSA may not be equivalent to factoring, Lecture Notes in Computer Science, vol.1403, pp.59-71, 1998.
DOI : 10.1007/BFb0054117

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

D. Coppersmith, M. K. Franklin, J. Patarin, and M. K. Reiter, Low-Exponent RSA with Related Messages, EUROCRYPT, pp.1-9, 1996.
DOI : 10.1007/3-540-68339-9_1

D. Pierre-alain-fouque, J. Vergnaud, and . Zapalowicz, Time/Memory/Data Tradeoffs for Variants of the RSA Problem, Lecture Notes in Computer Science, vol.7936, pp.651-662, 2013.
DOI : 10.1007/978-3-642-38768-5_57

J. Friedlander and I. Shparlinski, On the distribution of the power generator, Mathematics of Computation, vol.70, issue.236, pp.1575-1589, 2001.
DOI : 10.1090/S0025-5718-00-01283-7

E. Fujisaki, T. Okamoto, D. Pointcheval, and J. Stern, Rsaoaep is secure under the rsa assumption, Kilian [16], pp.260-274

R. Gennaro, An Improved Pseudo-random Generator Based on Discrete Log, CRYPTO, pp.469-481, 2000.
DOI : 10.1007/3-540-44598-6_29

J. Håstad, Solving Simultaneous Modular Equations of Low Degree, SIAM Journal on Computing, vol.17, issue.2, pp.336-341, 1988.
DOI : 10.1137/0217019

R. Lidl and H. Niederreiter, Finite Fields, 1996.
DOI : 10.1017/CBO9780511525926

S. Micali and C. Schnorr, Efficient, perfect polynomial random number generators, Journal of Cryptology, vol.3, issue.3, pp.157-172, 1991.
DOI : 10.1007/BF00196909
URL : http://nbn-resolving.de/urn/resolver.pl?urn=urn:nbn:de:bvb:12-bsb00057675-8

V. Shoup, Oaep reconsidered, Kilian [16], pp.239-259
DOI : 10.1007/3-540-44647-8_15

V. Shoup, A computational introduction to number theory and algebra, 2006.

T. Wooley, Vinogradov's mean value theorem via efficient congruencing, Annals of Mathematics, vol.175, issue.3, pp.1575-1627, 2012.
DOI : 10.4007/annals.2012.175.3.12
URL : http://arxiv.org/abs/1101.0574