Say , , so , and .
Say . Use the extended Euclidian algorithm to find that (because .
Now, , so , so .
Now, , so , so .
Thus this is correct.
Using an RSA code with the encryption integer e = 3 and distinct primes 3, 41 encode the message M = 5. Determine the decryption integer and check your encoded message by decoding it.
to get the decryption integer:
mod n (3-1) * (41-1) = 80
e*d = 1 mod 80
3*d = 1 mod 80
d = 27
to check message
im not sure how to do any help please?