Sieving Using Bucket Sort, Proceedings of ASIACRYPT '04, pp.92-102, 2004. ,
DOI : 10.1007/978-3-540-30539-2_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.143
Asymptotic semismoothness probabilities, Mathematics of Computation, vol.65, issue.216, pp.1701-1715, 1996. ,
DOI : 10.1090/S0025-5718-96-00775-2
CADO-NFS, an implementation of the number field sieve algorithm, 2013. ,
Factorisation of RSA-704 with CADO-NFS, Report, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00760322
Factoring large integers with the quadratic sieve, 1997. ,
Factoring integers with the number field sieve, Lenstra and Lenstra [14], pp.50-94 ,
DOI : 10.1109/TIT.1986.1057137
Predicting the Sieving Effort for the Number Field Sieve, Proceedings of ANTS-VIII, pp.167-179, 2008. ,
DOI : 10.1007/978-3-540-79456-1_11
Rotations and Translations of Number Field Sieve Polynomials, Proceedings of ASIACRYPT '03, pp.302-310, 2003. ,
DOI : 10.1007/978-3-540-40061-5_18
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. ,
Factorization of a 768-Bit RSA Modulus, Proceedings of the CRYPTO '10, pp.333-350, 2010. ,
DOI : 10.1007/978-3-642-14623-7_18
URL : https://hal.archives-ouvertes.fr/inria-00444693
A method of factoring and the factorization of F 7, Math. Comp, vol.29, issue.129, p.183205, 1975. ,
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. ,
The lattice sieve, Lenstra and Lenstra [14], pp.43-49 ,
DOI : 10.1090/psapm/042/1095550
Implementation of the continued fraction integer factoring algorithm, Congr. Numer, vol.37, p.99118, 1983. ,
Ideas for finding better polynomials to use in GNFS E-mail address: shih.bai@gmail.com Mathematical Sciences Institute, Australian National University, Australia. E-mail address: nfs@rpbrent, Workshop on Factoring Large Numbers, Discrete Logarithmes and Cryptanalytical Hardware, Institut für Experimentelle Mathematik, 2008. ,