Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4598897 | Linear Algebra and its Applications | 2015 | 31 Pages |
Abstract
The number field sieve is the most efficient known algorithm for factoring large integers that are free of small prime factors. For the polynomial selection stage of the algorithm, Montgomery proposed a method of generating polynomials which relies on the construction of small modular geometric progressions. Montgomery's method is analysed in this paper and the existence of suitable geometric progressions is considered.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Nicholas Coxon,