On polynomial selection for the general number field sieve |
| |
| Authors: | Thorsten Kleinjung. |
| |
| Affiliation: | Department of Mathematics, University of Bonn, Beringstrasse 1, 53115 Bonn, Germany |
| |
| 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. |
| |
| Keywords: | Integer factorization GNFS polynomial selection |
|
| 点击此处可从《Mathematics of Computation》浏览原始摘要信息 |
|
点击此处可从《Mathematics of Computation》下载全文 |
