Improving Polynomial Choice
The choice of polynomial can dramatically affect the time to complete the remainder of the algorithm. The method of choosing polynomials based on the expansion of n in base m shown above is suboptimal in many practical situations, leading to the development of better methods.
One such method was suggested by Murphy and Brent; they introduce a two-part score for polynomials, based on the presence of roots modulo small primes and on the average value that the polynomial takes over the sieving area.
The best reported results were achieved by the method of Thorsten Kleinjung, which allows g(x) = ax + b, and searches over a composed of small prime factors congruent to 1 modulo 2d and over leading coefficients of f which are divisible by 60.
Read more about this topic: General Number Field Sieve
Famous quotes containing the words improving and/or choice:
“The market came with the dawn of civilization and it is not an invention of capitalism.... If it leads to improving the well-being of the people there is no contradiction with socialism.”
—Mikhail Gorbachev (b. 1931)
“I think there is choice possible at any moment to us, as long as we live. But there is no sacrifice. There is a choice, and the rest falls away. Second choice does not exist. Beware of those who talk about sacrifice.”
—Muriel Rukeyser (1913–1980)