K. Aoki, J. Franke, T. Kleinjung, A. Lenstra, and D. Osvik, Electronic newsgroup posting announcing the factorization of the 1039-th Mersenne number by the snfs, 2007.

M. Bellare, C. Namprempre, D. Pointcheval, and M. Semanko, The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme, Journal of Cryptology, vol.16, issue.3, pp.185-215, 2003.
DOI : 10.1007/s00145-002-0120-1

J. P. Buhler, A. K. Lenstra, and J. M. Pollard, Factoring integers with the number field sieve The development of the number field sieve, pp.50-94, 1993.

´. E. Brier, C. Clavier, J. Coron, and D. Naccache, Cryptanalysis of RSA Signatures with Fixed-Pattern Padding, Proceedings of Crypto'01, pp.433-439, 2001.
DOI : 10.1007/3-540-44647-8_25

A. Commeine and I. , Semaev An algorithm to solve the discrete logarithm problem with the number field sieve, Proceedings of the 9-th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography, pp.174-190, 2006.

J. Coron, D. Naccache, and J. P. , Stern On the Security of rsa padding, Proceedings of Crypto'99, pp.1-18, 1999.

D. Jonge and D. Chaum, Attacks on Some RSA Signatures, Proceedings of Crypto'85, pp.18-27, 1986.
DOI : 10.1007/3-540-39799-X_3

W. Eberly, M. Giesbrecht, P. Giorgi, A. Storjohann, and G. Villard, Solving sparse rational linear systems, Proceedings of the 2006 international symposium on Symbolic and algebraic computation , ISSAC '06, pp.63-70, 2006.
DOI : 10.1145/1145768.1145785

W. Eberly, M. Giesbrecht, P. Giorgi, A. Storjohann, and G. Villard, Faster inversion and other black box matrix computations using efficient block projections, Proceedings of the 2007 international symposium on Symbolic and algebraic computation , ISSAC '07, pp.143-150, 2007.
DOI : 10.1145/1277548.1277569
URL : https://hal.archives-ouvertes.fr/hal-00127807

M. Girault and J. Misarksy, Selective Forgery of RSA Signatures Using Redundancy, Proceedings of Eurocrypt'97, pp.495-507, 1997.
DOI : 10.1007/3-540-69053-0_34

A. Joux and R. Lercier, Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method, Mathematics of Computation, vol.72, issue.242, pp.953-967, 2003.
DOI : 10.1090/S0025-5718-02-01482-5
URL : https://hal.archives-ouvertes.fr/hal-01102016

A. K. Lenstra, H. W. Lenstra, J. , M. S. Manasse, and J. M. Pollard, The number field sieve The development of the number field sieve, pp.11-42, 1993.

A. K. Lenstra and I. Shparlinski, Selective forgery of rsa signatures with fixedpattern padding, Proceedings of the 5-th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography, pp.228-236, 2002.

J. Misarsky, A multiplicative attack using LLL algorithm on RSA signatures with redundancy, Proceedings of Crypto'97, pp.221-234, 1997.
DOI : 10.1007/BFb0052238

J. Misarsky, How (not) to design RSA signature schemes, Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography, pp.14-28, 1998.
DOI : 10.1007/BFb0054011

P. L. Montgomery, Square roots of products of algebraic numbers Mathematics of Computation 1943?1993: A Half-Century of, of Proc. Sympos, pp.567-571, 1994.