D. Boneh and G. Durfee, Cryptanalysis of RSA with Private Key d Less than N 0.292, IEEE Transactions on Information Theory, vol.46, issue.4, p.1339, 2000.
DOI : 10.1007/3-540-48910-X_1

A. Bostan, P. Gaudry, and E. 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

Z. Brakerski and V. Vaikuntanathan, Efficient fully homomorphic encryption from (standard) LWE. Cryptology ePrint Archive, Report, vol.344, 2011.

Y. Chen and P. Q. Nguyen, BKZ 2.0: Better Lattice Security Estimates, Proc. ASIACRYPT '11, Lecture Notes in Comput. Sci, 2011.
DOI : 10.1007/978-3-642-25385-0_1
URL : https://hal.archives-ouvertes.fr/hal-01109961

H. Cohn and N. Heninger, Approximate common divisors via lattices, The Open Book Series, vol.1, issue.1, 2011.
DOI : 10.2140/obs.2013.1.271

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

J. Coron, A. Joux, A. Mandal, D. Naccache, and M. Tibouchi, Cryptanalysis of the RSA Subgroup Assumption from TCC 2005, Public Key Cryptography -Proc. PKC 2011, pp.147-155, 2005.
DOI : 10.1007/978-3-642-19379-8_9
URL : https://hal.archives-ouvertes.fr/hal-01110234

J. Coron, A. Mandal, D. Naccache, and M. Tibouchi, Fully Homomorphic Encryption over the Integers with Shorter Public Keys, Advances in Cryptology -Proc. CRYPTO 2011, 2011.
DOI : 10.1007/978-3-642-22792-9_28
URL : https://hal.archives-ouvertes.fr/hal-01110216

C. Gentry, Fully homomorphic encryption using ideal lattices, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.169-178, 2009.
DOI : 10.1145/1536414.1536440

C. Gentry and S. Halevi, Public challenges for fully-homomorphic encryption Available at https://researcher.ibm.com/researcher/view_project.php?id=1548. The implementation is described in, 2010.

C. Gentry and S. Halevi, Fully homomorphic encryption without squashing using depth-3 arithmetic circuits. Cryptology ePrint Archive, Report, vol.279, 2011.

C. Gentry and S. Halevi, Implementing Gentry???s Fully-Homomorphic Encryption Scheme, Advances in Cryptology -Proc. EUROCRYPT 2011, pp.129-148, 2011.
DOI : 10.1007/978-3-642-20465-4_9

J. Groth, Cryptography in Subgroups of $\mathbb{Z}_{n}^{*}$, Proc. TCC 2005, pp.50-65, 2005.
DOI : 10.1007/978-3-540-30576-7_4

D. Harvey and D. S. Roche, An in-place truncated fourier transform and applications to polynomial multiplication, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, pp.325-329, 2010.
DOI : 10.1145/1837934.1837996

N. Howgrave-graham, Approximate Integer Common Divisors, Proc. CaLC '01, pp.51-66, 2001.
DOI : 10.1007/3-540-44670-2_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.4244

T. Kleinjung, K. Aoki, J. Franke, A. K. Lenstra, E. Thomé et al., Factorization of a 768-Bit RSA Modulus, Proc. CRYPTO '10, pp.333-350, 2010.
DOI : 10.1007/978-3-642-14623-7_18
URL : https://hal.archives-ouvertes.fr/inria-00444693

T. Mateer, Fast Fourier Transform Algorithms with Applications, 2008.

A. May, Using LLL-Reduction for Solving RSA and Factorization Problems, 2010.
DOI : 10.1007/978-3-642-02295-1_10

P. L. Montgomery, An FFT Extension of the Elliptic Curve Method of Factorization, 1992.

P. Q. Nguyen, Public-key cryptanalysis, Recent Trends in Cryptography, 2009.
DOI : 10.1090/conm/477/09304

J. M. Pollard, Theorems on factorization and primality testing, Proc. Cambridge Philos. Soc, pp.521-528, 1974.
DOI : 10.2307/2003473

G. Qiao and K. Lam, RSA Signature Algorithm for Microcontroller Implementation, Proc. CARDIS '98, pp.353-356, 2000.
DOI : 10.1007/10721064_32

D. S. Roche, Space- and time-efficient polynomial multiplication, Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pp.295-302, 2009.
DOI : 10.1145/1576702.1576743
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.330.3937

D. R. Stinson, Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem, Mathematics of Computation, vol.71, issue.237, pp.379-391, 2002.
DOI : 10.1090/S0025-5718-01-01310-2

M. Van-dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, Fully Homomorphic Encryption over the Integers, Advances in Cryptology -Proc. EUROCRYPT 2010, pp.24-43, 2010.
DOI : 10.1007/978-3-642-13190-5_2

J. Zur-gathen and J. Gerhard, Modern computer algebra, 2003.
DOI : 10.1017/CBO9781139856065