17 references, page 1 of 2 1. S. Bai, P. Gaudry, A. Kruppa, F. Morain, L. Muller, E. Thom´e, P. Zimmermann, and et al. CADO-NFS v1.1, an implementation of the number field sieve. http://cado-nfs.gforge. inria.fr, 2011.
2. H. Boender. Factoring large integers with the quadratic sieve. PhD thesis, Leiden University, 1997.
3. J. Buhler, H. Lenstra, and C. Pomerance. Factoring integers with the number field sieve. In Lenstra and Lenstra [10], pages 50-94.
4. H. Cram´er. Mathematical Methods of Statistics. Princeton University Press, 1999.
5. W. Gautschi. Chapter 7. Error function and Fresnel integrals. In M. Abramowitz and I. A. Stegun, editors, Handbook of Mathematical Functions: with Formulas, Graphs, and Mathematical Tables, page 1046. Dover Publications, 1972.
6. A. Granville. Smooth numbers: computational number theory and beyond. In Proc. MSRI Conf. Algorithmic Number Theory: Lattices, Number Fields, Curves and Cryptography. MSRI Publications, Volume 44, 2008.
7. A. Hildebrand and G. Tenenbaum. Integers without large prime factors. Journal de Th´eorie des Nombres de Bordeaux, 5(2):411-484, 1993.
8. T. Kleinjung. On polynomial selection for the general number field sieve. Mathematics of Computation, 75(256):2037-2047, 2006.
9. T. Kleinjung. Polynomial selection. In CADO workshop on integer factorization, INRIA Nancy, 2008. http://cado.gforge.inria.fr/workshop/slides/kleinjung.pdf.
10. A. K. Lenstra and H. W. Lenstra, Jr., editors. The Development of the Number Field Sieve, volume 1554 of Lecture Notes in Mathematics. Springer, 1993.