| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 401276 | Journal of Symbolic Computation | 2012 | 9 Pages |
Abstract
We present an algorithm to find two non-linear polynomials for the Number Field Sieve integer factorization method. This algorithm extends Montgomery’s “two quadratics” method; for degree 33, it gives two skewed polynomials with resultant O(N5/4)O(N5/4), which improves on the Williams O(N4/3)O(N4/3) result (Williams, 2010).
► We present a new algorithm to find two non-linear polynomials for NFS. ► This algorithm extends Montgomery’s “two quadratics” method. ► For degree 3, it gives two skewed polynomials with resultant O(N5/4)O(N5/4). ► This improves on the Williams O(N4/3)O(N4/3) result (Williams, 2010).
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Thomas Prest, Paul Zimmermann,