Thursday, January 18, 2018

Verifying RSA decryption equation

I was reading Wikipedia on RSA algorithm for asymmetric key encryption. At first, the decryption equation seemed like magic. Tried to verify quickly that raising cipher to the exponent and then doing a modulus with n will give the actual message. Below, the result.


No comments:

Post a Comment