
Re: Prime factorization
Posted:
Nov 11, 2013 11:03 PM


On Monday, November 4, 2013 12:49:47 PM UTC5, Michael F. Stemper wrote: > On 11/04/2013 11:35 AM, me wrote: > > > tell me what you think? > > > http://www.davesinvoice.com/papers/factorization2.pdf > > > > Interesting idea. How about using it to factor 130642890110987?
>>> Factor(130642890110987) [58789, 2222233583, 134, 'Pollard Rho, x^2 + 1, First factor check']
Pollard Rho is a very efficient means to factor numbers of this size.
It factored 130642890110987 almost instantly in 134 steps into 58789 * 2222233583. It iterated on the polynomial x^2+1.
Kermit

