Do you mean you are factoring something other than random numbers, or do you mean your Pollard Rho is completely deterministic?
It's not a good measure of performance to time just one factorisation with Pollard Rho, since you could just pick the parameters such that it essentially succeeds immediately. You should give times for a range of numbers. Bill. On 4 November 2015 at 18:55, janvanoort <[email protected]> wrote: > That's interesting. I have been working for a week now on a somewhat > improved > version of Pollard's Rho, by "feeding" it with something else than a random > number, in order to take away the non-deterministic behaviour. My > implementation is written in Java 8 ( have had no time to port it to Julia, > yet ), and factors 3^100+2 in about 800 milliseconds an a Xeon E3-1265L > with > 8 MB cache, on Linux ( Ubuntu Server ). If anyone's interested, feel free > to > ping me. > > > > -- > View this message in context: > http://julia-programming-language.2336112.n4.nabble.com/Factorization-of-big-integers-is-taking-too-long-tp15925p30844.html > Sent from the Julia Users mailing list archive at Nabble.com. >
