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)