![]() |
|
#3
|
|||
|
|||
|
From the description you provide I can guess it is something asymmetric.
16 steps may be x^2 16 times, then step 17 +x. Totally 65537 prime. Then full algo may be powmod(data, 0x10001, N), where N == magic? void decode_1(unsigned int *src, unsigned int iter, unsigned int *dest) = bigint.mul void decode_2(unsigned int *src, unsigned int *key) = bigint.sub |
|
|
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Pointers in Delphi | chessgod101 | Source Code | 1 | 04-06-2014 23:54 |
| Need some pointers with a .Net target | Sailor_EDA | General Discussion | 10 | 03-03-2010 12:18 |
| x64 Website Pointers | Evilcry | x64 OS | 3 | 10-01-2009 22:25 |
| Need some pointers | lorn | General Discussion | 8 | 11-04-2004 13:20 |