W. Alexi, B. Chor, O. Goldreich, and C. Schnorr, RSA and Rabin Functions: Certain Parts are as Hard as the Whole, SIAM Journal on Computing, vol.17, issue.2, pp.194-209, 1988.
DOI : 10.1137/0217013

S. Babbage, A space/time tradeoff in exhaustive search attacks on stream ciphers, IEE Conference Publication -European Convention on Security and Detection, 1995.

E. Barkan, E. Biham, and A. Shamir, Rigorous bounds on cryptanalytic time/memory tradeoffs Advances in Cryptology ? Crypto, LNCS, vol.4117, pp.1-21, 2006.

A. Biryukov and A. Shamir, Cryptanalytic time/memory/data tradeoffs for stream ciphers Advances in Cryptology ? Asiacrypt, LNCS, vol.1976, pp.1-13, 2000.

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

M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo random bits, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), pp.850-864, 1984.
DOI : 10.1109/SFCS.1982.72

D. Boneh, A. Joux, and P. Q. Nguyen, Why textbook ElGamal and RSA encryption are insecure Advances in Cryptology ? Asiacrypt, LNCS, vol.1976, pp.30-43, 2000.

A. Bostan, P. Gaudry, and . Schost, Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier???Manin Operator, SIAM Journal on Computing, vol.36, issue.6, pp.1777-1806, 2007.
DOI : 10.1137/S0097539704443793
URL : https://hal.archives-ouvertes.fr/inria-00103401

Y. Chen and P. Q. Nguyen, Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers, Advances in Cryptology ? Eurocrypt 2012, pp.502-519, 2012.
DOI : 10.1007/978-3-642-29011-4_30
URL : https://hal.archives-ouvertes.fr/hal-00864374

D. Coppersmith, Finding a Small Root of a Univariate Modular Equation, Advances in Cryptology ? Eurocrypt'96 (U. M. Maurer Advances in Cryptology ? Eurocrypt'96 (U. M. Maurer, pp.178-189, 1996.
DOI : 10.1007/3-540-68339-9_14

J. Coron, A. Joux, A. Mandal, D. Naccache, and M. Tibouchi, Cryptanalysis of the RSA subgroup assumption from TCC 2005, PKC 2011: 14th International Workshop on Theory and Practice in, LNCS, vol.6571, pp.147-155, 2011.

A. Fiat and M. Naor, Rigorous Time/Space Trade-offs for Inverting Functions, SIAM Journal on Computing, vol.29, issue.3, pp.790-803, 1999.
DOI : 10.1137/S0097539795280512

C. Fiduccia, Polynomial evaluation via the division algorithm the fast Fourier transform revisited, Proceedings of the fourth annual ACM symposium on Theory of computing , STOC '72, pp.88-93, 1972.
DOI : 10.1145/800152.804900

R. Gennaro, An Improved Pseudo-Random Generator Based on the Discrete Logarithm Problem, Journal of Cryptology, vol.18, issue.2, pp.91-110, 2005.
DOI : 10.1007/s00145-004-0215-y

J. D. Golic, Cryptanalysis of alleged A5 stream cipher Advances in Cryptology ? Eurocrypt'97, LNCS, vol.1233, pp.239-255, 1997.

J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby, A Pseudorandom Generator from any One-way Function, SIAM Journal on Computing, vol.28, issue.4, pp.1364-1396, 1999.
DOI : 10.1137/S0097539793244708

J. Håstad and M. Näslund, The security of all RSA and discrete log bits, Journal of the ACM, vol.51, issue.2, pp.187-230, 2004.
DOI : 10.1145/972639.972642

M. E. Hellman, A cryptanalytic time-memory trade-off, IEEE Transactions on Information Theory, vol.26, issue.4, pp.401-406, 1980.
DOI : 10.1109/TIT.1980.1056220

M. Herrmann and A. May, Attacking power generators using unravelled linearization: When do we output too much? Advances in Cryptology ? Asiacrypt, LNCS, vol.5912, pp.487-504, 2009.

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

P. Oechslin, Making a faster cryptanalytic time-memory trade-off Advances in Cryptology ? Crypto, LNCS, vol.2729, pp.617-630, 2003.

R. Schroeppel, A. Shamir, and A. T. , A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems, SIAM Journal on Computing, vol.10, issue.3, pp.456-464, 1981.
DOI : 10.1137/0210033

R. Steinfeld, J. Pieprzyk, and H. Wang, On the provable security of an efficient RSA-based pseudorandom generator Advances in Cryptology ? Asiacrypt, LNCS, vol.4284, pp.194-209, 2006.