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.
