While studying RSA, I saw this decryption form.
M = Cd mod N
If i know M,d,N
, How Can I get C
data from this expression?
Is there any solution?
In the comments, @President James k.Polk said:
This is the RSA problem. You cannot obtain C unless you have the "other" exponent or the parameters are small enough that brute force or factoring are computationally feasible.