Skip navigation
Skip navigation

On quadratic polynomials for the number field sieve

Murphy, Brian; Brent, Richard P


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]

CollectionsANU Research Publications
Date published: 1997
Type: Working/Technical Paper


File Description SizeFormat Image
TR-CS-97-17.pdf274.25 kBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator