, CADO-NFS v1.1, an implementation of the number field sieve, 2011.
, Factoring large integers with the quadratic sieve, 1997.
, Factoring integers with the number field sieve, Lenstra and Lenstra [10], pp.50-94
DOI : 10.1109/TIT.1986.1057137
, Mathematical Methods of Statistics, 1999.
, Chapter 7 Error function and Fresnel integrals, Handbook of Mathematical Functions: with Formulas, Graphs, and Mathematical Tables, p.1046, 1972.
, Smooth numbers: computational number theory and beyond Algorithmic Number Theory: Lattices, Number Fields, Curves and Cryptography, Proc. MSRI Conf, 2008.
, Integers without large prime factors, Journal de Th??orie des Nombres de Bordeaux, vol.5, issue.2, pp.411-484, 1993.
DOI : 10.5802/jtnb.101
, On polynomial selection for the general number field sieve, Mathematics of Computation, vol.75, issue.256, pp.2037-2047, 2006.
DOI : 10.1090/S0025-5718-06-01870-9
, Polynomial selection, CADO workshop on integer factorization, 2008.
, Modelling the yield of number field sieve polynomials, Algorithmic Number Theory -ANTS III, pp.137-147, 1998.
DOI : 10.1007/BFb0054858
, Polynomial selection for the number field sieve integer factorisation algorithm, 1999.
, On quadratic polynomials for the number field sieve, Proceedings of the CATS '98, pp.199-213, 1998.
, Call for volunteers: RSA768 polynomial selection, 2011.
, Msieve v1, 2011.
, The lattice sieve, Lenstra and Lenstra, pp.43-49
DOI : 10.1090/psapm/042/1095550
, Factorization of a 768-Bit RSA Modulus, Proceedings of CRYPTO '10, pp.333-350, 2010.
DOI : 10.1007/978-3-642-14623-7_18
URL : https://hal.archives-ouvertes.fr/inria-00444693
, E-mail address: shi.bai@anu