You are right. What I mean, is that my Pollard Rho is completely deterministic.
Times for ranges of numbers: bitlength < 20 100 µs - 300 µs 20 < bit length < 40 around 3 ms random numbers with bitlength ~1024 3 ms - 800 ms, depending on size of smallest prime factor ( for this post, in order to check, I just made it factor the Mersenne number 2^1117-1; it came up with the factor 53617 in 860 ms ) 2015-11-04 20:57 GMT+01:00 Julia Users mailing list [via Julia Programming Language] <[email protected]>: > 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 <[hidden email] > <http:///user/SendEmail.jtp?type=node&node=30867&i=0>> 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. >> > > > > ------------------------------ > If you reply to this email, your message will be added to the discussion > below: > > http://julia-programming-language.2336112.n4.nabble.com/Factorization-of-big-integers-is-taking-too-long-tp15925p30867.html > To unsubscribe from Factorization of big integers is taking too long, click > here > <http://julia-programming-language.2336112.n4.nabble.com/template/NamlServlet.jtp?macro=unsubscribe_by_code&node=15925&code=aXBzZWphbkBnbWFpbC5jb218MTU5MjV8ODc1MDMwODkz> > . > NAML > <http://julia-programming-language.2336112.n4.nabble.com/template/NamlServlet.jtp?macro=macro_viewer&id=instant_html%21nabble%3Aemail.naml&base=nabble.naml.namespaces.BasicNamespace-nabble.view.web.template.NabbleNamespace-nabble.view.web.template.NodeNamespace&breadcrumbs=notify_subscribers%21nabble%3Aemail.naml-instant_emails%21nabble%3Aemail.naml-send_instant_email%21nabble%3Aemail.naml> > -- View this message in context: http://julia-programming-language.2336112.n4.nabble.com/Factorization-of-big-integers-is-taking-too-long-tp15925p30868.html Sent from the Julia Users mailing list archive at Nabble.com.
