Indexed metadata
On polynomial selection for the general number field sieve
Thorsten Kleinjung
Source record
Source: Crossref
Published: Jun 28, 2006
DOI: 10.1090/s0025-5718-06-01870-9
Open original source ↗Source abstract
The general number field sieve (GNFS) is the asymptotically fastest algorithm for factoring large integers. Its runtime depends on a good choice of a polynomial pair. In this article we present an improvement of the polynomial selection method of Montgomery and Murphy which has been used in recent GNFS records.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.