B. Carrier, S. S. Wagstaff, and J. , Implementing the hypercube quadratic sieve with two large primes, International Conference on Number Theory for Secure Communications, pp.51-64, 2003.

D. J. Bernstein, How to find smooth parts of integers, 2004.

J. F. Biasse, Improvements in the computation of ideal class groups of imaginary quadratic number fields, Advances in Mathematics of Communications, vol.4, issue.2, 2009.
DOI : 10.3934/amc.2010.4.141
URL : https://hal.archives-ouvertes.fr/inria-00397408

D. Boneh, Twenty years of attacks on the rsa cryptosystem, Notices of the AMS, vol.46, pp.203-213, 1999.

R. Brent, Some Integer Factorization Algorithms using Elliptic Curves, 1985.

J. Buchmann, A subexponential algorithm for the determination of class groups and regulators of algebraic number fields, Progress in Mathematics, pp.27-41, 1988.

S. Contini, Factoring integers with the self-initializing quadratic sieve, 1997.

T. Kleinjung, Factorization of a 768-bit rsa modulus. Cryptology ePrint Archive, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00444693

J. E. Gower and S. S. Wagstaff-jr, Square form factorization, Mathematics of Computation, vol.77, issue.261, 2007.
DOI : 10.1090/S0025-5718-07-02010-8

. H. Jr and . Lenstra, Factoring Integers with Elliptic Curves, Annals of Mathematics, vol.126, pp.649-673, 1987.

M. J. Jacobson-jr, Applying sieving to the computation of quadratic class groups, Mathematics of Computation, vol.68, issue.226, pp.859-867, 1999.
DOI : 10.1090/S0025-5718-99-01003-0

K. Gaj, Implementing the Elliptic Curve Method of Factoring in Reconfigurable Hardware, Cryptographic Hardware and Embedded Systems -CHES 2006, pp.119-133, 2006.
DOI : 10.1007/11894063_10

J. Mckee, Speeding Fermat's factoring method, Mathematics of Computation, vol.68, issue.228, pp.1729-1737, 1999.
DOI : 10.1090/S0025-5718-99-01133-3

P. Montgomery, Speeding the Pollard and elliptic curve methods of factorization, Mathematics of Computation, vol.48, issue.177, pp.243-264, 1987.
DOI : 10.1090/S0025-5718-1987-0866113-7

M. A. Morrison and J. Brillhart, A method of factoring and the factorization of F7, Mathematics of Computation, vol.29, issue.129, pp.183-205, 1975.

A. M. Odlyzko, Discrete logarithms in finite fields and their cryptographic significance, Advances in Cryptology, pp.224-314, 1985.
DOI : 10.1007/3-540-39757-4_20

D. Parkinson and M. C. Wunderlich, A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers, Parallel Computing, vol.1, issue.1, pp.65-73, 1984.
DOI : 10.1016/S0167-8191(84)90424-1

C. Pomerance, H. W. Lenstra, J. , and R. Tijdeman, Analysis and comparison of some integer factoring algorithms, Computational Methods in Number Theory, Part I, pp.89-139, 1982.

D. Shanks, Unpublished notes on SQUFOF, 1975.

R. D. Silverman, The multiple polynomial quadratic sieve, Mathematics of Computation, vol.48, issue.177, pp.329-339, 1987.
DOI : 10.1090/S0025-5718-1987-0866119-8

H. C. Williams and M. C. Wunderlich, On the parallel generation of the residues for the continued fraction factoring algorithm, Mathematics of Computation, vol.48, issue.177, pp.405-423, 1987.
DOI : 10.1090/S0025-5718-1987-0866124-1