Polynomial Selection in the Number Field Sieve
Hong Wang · Journal of Information Engineering University · 2003
The number field sieve (NFS) is the asymptotically fastest method known thus far.Polynomial selection is one important part in the number field sieve.It affects the speed and consuming time of the whole algorithm.The key in the polynomial selection is the size of the polynomial.In this paper,the authors analysis the size of the polynomial in detail, and present a way of choosing the degree of the polynomial.