Perform encryption using the RSA algorithm for the following:
p=5, q=9, e=2, M=5
p=4, q=12, e=4, M=3
C=Me mod n
C is the cipher text and M is the plain text, n=p×q
Solution:
(a)
Given,
=>RSA algorithm is used.
=>p= 5, q = 9, e = 2 and M = 5
Explanation:
Finding value of n:
=>n = p*q
=>n = 5*9
=>n = 45
Performing encryption:
=>Ciphertext(C) = M^e mod n
=>C = 5^2 mod 45
=>C = 25 mod 45
=>C = 25
(b)
Given,
=>p = 4, q = 12, e = 4 and M = 3
Explanation:
Finding value of n:
=>n = p*q
=>n = 4*12
=>n = 48
Performing encryption:
=>Ciphertext(C) = M^e mod n
=>C = 3^4 mod 48
=>C = 81 mod 48
=>C = 33
I have explained each and every part with the help of statements attached to it.
Get Answers For Free
Most questions answered within 1 hours.