Which prime number sieve are you using, Eratosthenes, Atkins, or a different one?
|
|
03-10-2012, 06:46 AM
Well I have generated this number that has 2 prime factors, both of which I have saved. I am trying to use several computers to factor it and it seems to be going pretty slow.
If anyone out there thinks they can factor it before me, give it a shot, if you do you should shareCode:126398767935390469822843550030221485937
Good luck, and I'll let you know if I get it (I WONT CHEAT!)
P.S. I used a bit sieve to optimize the cross checking!
You can try leaving your computer on all night with Pollard-RHO, but I doubt it will finish.
Btw this is a 128 bit value, with 2 64 bit (or close to) prime factors!
Depending on how successful my factorization system works (distributed factorization) I might release it, it just depends on if it actually performs well.
IF you use any website that some how "magically" factors this (Method...) Do not respond on this thread unless you KNOW exactly how it's done, that is the only reason I made this thread was to see if any of you knew a thing or two and could help me out with this. Thanks in advance.
Which prime number sieve are you using, Eratosthenes, Atkins, or a different one?
Originally Posted by blakeman8192
factored in 0d 0h 0m 0.4s using Eliptic Curve method
though I don't know if that's embarrassingly parallel.. it probably is
The Sieve stage of the Quadratic Number Sieve and the Number Field Sieve is embarrassingly parallel though. The ECM has source code available (http://www.alpertron.com.ar/ecm.zip) I wish more stuff like this would be available online.
http://en.wikipedia.org/wiki/Lenstra..._factorization
http://www.mersennewiki.org/index.php/GMP-ECM
good step by step explanation on how to do it:
http://www.mersennewiki.org/index.php/ECM
that is really to bad they used BigInteger in the java version, i might just try compiling the c version and using it as a native. thanks, btw msn me the factors just to make sure you got them right.factored in 0d 0h 0m 0.4s using Eliptic Curve method
though I don't know if that's embarrassingly parallel.. it probably is
The Sieve stage of the Quadratic Number Sieve and the Number Field Sieve is embarrassingly parallel though. The ECM has source code available (http://www.alpertron.com.ar/ecm.zip) I wish more stuff like this would be available online.
Lenstra elliptic curve factorization - Wikipedia, the free encyclopedia
GMP-ECM - Mersennewiki
good step by step explanation on how to do it:
Elliptic curve method - Mersennewiki
| « TwoD - A new GameEngine experience! | Boredom/FalseHopeForNoobs Project » |
| Thread Information |
Users Browsing this ThreadThere are currently 1 users browsing this thread. (0 members and 1 guests) |
Cups