View Single Post
Old 2010-02-11, 11:32   #2
R.D. Silverman
 
R.D. Silverman's Avatar
 
"Bob Silverman"
Nov 2003
North of Boston

164448 Posts
Default

Quote:
Originally Posted by Random Poster View Post
As most readers probably know, the quadratic sieve factors a number n by finding values of x such that P(x) = x^2 - n is a product of small factors.
May I suggest that you read about the algorithm? Your description
described the algorithm as it was implemented in 1982 by J. Gervers.
It has not been implemented this way since 1984.

Quote:
This could be also done with multiples of n; more precisely, let m range from 1 to M and sieve for P(x) = x^2 - mn with x near sqrt(mn). Any thoughts?
You are 25 years too late with your suggestion. Read my 1987 paper:

The Multiple Polynomial Quadratic Sieve
Math. Comp. 1987
R.D. Silverman is offline   Reply With Quote