Find the secret key for this function

		Exetools > General > General Discussion
Find the secret key for this function

06-03-2016, 03:35

Syoma

reverse engineer

Join Date: May 2009

Posts: 338

Rept. Given: 35

Rept. Rcvd 77 Times in 50 Posts

Thanks Given: 15

Thanks Rcvd at 78 Times in 51 Posts

Quote:

Originally Posted by Kerlingen

RSA is x^y with known x and unknown y.
This is x^y with unknown x and known y.
Two completely different things.

RSA powmod primitive is
c = m^e mod N, where c is ciphertext, m - message, e - public exponent, N - modulus
m = c^d mod N, where d is private exponent

our case is
0x90de757572b51cd3 = key^7 mod (max_uint64+1)

Last edited by Syoma; 06-03-2016 at 03:36. Reason: wrong summary

The Following 3 Users Say Thank You to Syoma For This Useful Post:
dila (06-03-2016), niculaita (06-03-2016)

« Previous Thread | Next Thread »

Posting Rules
You may not post new threads You may not post replies You may not post attachments You may not edit your posts BB code is On Smilies are On [IMG] code is Off HTML code is Off Forum Rules

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

All times are GMT +8. The time now is 09:03.