![]() |
|
#10
|
|||
|
|||
|
Did you ever read the topic? I wrote
It is the standard x^y mod n = c like RSA uses but with bad modulo N. I did not write it is RSA. My suggestion was there may be simple math solution in number theory. Just reviewed most popular directions. Do not see any simple solution. x^7 = 3*3*31*4129*1499933*6041353 mod 2^64 Last edited by Syoma; 06-03-2016 at 16:54. Reason: Brutforce only? |
| The Following User Says Thank You to Syoma For This Useful Post: | ||
dila (06-05-2016) | ||
|
|
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| GMP function | Git | General Discussion | 4 | 06-16-2011 21:33 |
| FUNCTION CHUNKs | Git | General Discussion | 4 | 09-07-2005 19:35 |
| C++ Help (Hooking a function) | Peter[Pan] | General Discussion | 8 | 08-31-2004 20:37 |