C Program Suppose the two primes in the RSA schema are p13 a

C++ Program:

Suppose the two primes in the RSA schema are p=13 and q=23. Find and output the numbers r, e, and d. And show that a plain text, say 225 can be recovered using public key P=(e,n) and secret key S=(d,n)

Solution

r = 264, e = 5, d = 53
Cipher = (Msg)^e Mod N would be encrypted text

(225)^5 mod 299 = 49

Msg = (Cipher)^d mod N would be decrypted text

(49)^53 mod 299 = 225