![]() |
|
#11
|
|||
|
|||
|
Quote:
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. Last edited by contextrax; 09-27-2017 at 18:20. |
| Tags |
| bolero, ecdlp |
| Thread Tools | |
| Display Modes | |
|
|
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Replacing ECDSA in Target (arma) | Mynotos | General Discussion | 3 | 11-22-2019 00:49 |