Quote:
Originally Posted by contextrax
The solver is hard coded to use the armadillo crypto params so I need to make a new version with the crypto params for the new target.
But it would take you like 1.7 years to solve with your two computers.
To calculate running time you can take 2^52 / (speed*3600*24) = ~number of days.
The algorithm used is Pollards Rho and it's based on the birthday paradox (luck)
you might solve faster or slower depends on how lucky you are.
(oh and it's 2^52 coz the frobenius and negation map is used. Without this it would be ~2^56)
As far as I can remember it's only the ECC keys that will need this much computer power to solve.
All other keys are based on DLP over a prime field (using ElGamal if I remember) and can be solved using sub exponential algo like Index Calculus.
|
It is ok, I have available more servers. I just participate on your project with two machines. Also I can get other friend machines so I will get nearly your computing power without problem. But you will have to make public also the server part of your solver to be able collect data centrally.
10-02-2017, 18:55
Similar Threads
Threaded Mode