Thread: Integer Factorization View Single Post
 2007-06-24, 18:03 #8 mgb   "Michael" Aug 2006 Usually at home 10100002 Posts Thanks Paul for your analysis. I have found it is also possible to do a variation on this. Let M be a small integer. Let k vary a la Pollard Rho - f(k) = ??? modulo s where s is the square root of the number to be factored. With each iteration increment M and let k1 = f(k0) modulo s. Let H = Mk modulo n. Then try a0H modulo n. Last fiddled with by mgb on 2007-06-24 at 18:04