|
|
|
|
#1
05-07-2016, 18:55
|
||||
|
||||
|
There is nothing to invent trying to solve that keygenme, all that you have to do is the ecdlp after having reduced N to 7 bytes length, which is was not obviously a prime number (see the multiple polynomial quadratic sieve approach). The "HANDBOOK of APPLIED CRYPTOGRAPHY" book will come in handy.
__________________
<<< The L10n won't give up >>> 
|
| The Following 2 Users Say Thank You to arlequim For This Useful Post: | ||
SmilingWolf (05-08-2016), tonyweb (05-10-2016) | ||
 |
| Thread Tools | |
| Display Modes | |
|
|
Hybrid Mode
