2000 character limit reached
Montgomery's method of polynomial selection for the number field sieve (1412.6011v1)
Published 18 Dec 2014 in cs.CR and math.NT
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.