On quadratic polynomials for the number field sieve
The 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...[Show more]
|Collections||ANU Research Publications|
|1575-01.2003-07-02T06:58:02Z.xsh||356 B||EPrints MD5 Hash XML|
|TR-CS-97-17.pdf||274.25 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.