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:
“My only companions were the mice, which came to pick up the crumbs that had been left in those scraps of paper; still, as everywhere, pensioners on man, and not unwisely improving this elevated tract for their habitation. They nibbled what was for them; I nibbled what was for me.”
—Henry David Thoreau (1817–1862)
“Live a thousand years,
I shall not find myself so apt to die.
No place will please me so, no mean of death,
As here by Caesar, and by you cut off,
The choice and master spirits of this age.”
—William Shakespeare (1564–1616)