Murphy, BrianBrent, Richard P2003-07-032004-05-192011-01-052004-05-192011-01-051997http://hdl.handle.net/1885/40747http://digitalcollections.anu.edu.au/handle/1885/40747The newest, and asymptotically the fastest known integer factorization algorithm is the number field sieve. The area in which the number field sieve has the greatest capacity for improvement is polynomial selection. The best known polynomial selection method finds quadratic polynomials. In this paper we examine the smoothness properties of integer values taken by these polynomials. Using this knowledge, we adapt a parameter a, developed for analysis of MPQS, to quadratic NFS polynomials. We estimate the yield of smooth values for these polynomials as a function of a, and conclude that practical changes in a might bring significant changes in the yield of smooth polynomial values, and polynomial values which are smooth but for the appearance of up to two large primes.280830 bytes356 bytesapplication/pdfapplication/octet-streamen-AUinteger factorisationnumber field sieve1997