On Sun, 16 Mar 2008 11:29:43 -0700 (PDT), JSH <jstevh@gmail.com> wrote:
>It took 10 seconds for this still relatively small number. Now what >does your code do? > >Example 20484149553887 That is a 45 bit number. How fast was your code for a 35 bit number? The ratio between the two will tell you how much to multiply by for every ten bit increment in size. Then work out how long a 500 bit number will take. For a more accurate timing do a number of factorisations in a tight loop and average out the time.
My code is set up to factor Java positive integers, up to 31 bits. At the moment, while your method is still in flux, I do not want to spend the time chasing a moving target. I have done enough timings to satisfy myself that your method is not fast enough to factor an RSA number. If you disagree then you are free to post your timings here. Better still, post the factors of an RSA number.
When you have a settled version I may take the time to recode to cover longs. Until you have a settled version I will not bother. As I said, you are free to provide your own timings.
