In the RSA public key cryptosystem, the private and public keys are (e,n) and (d,n) respectively, where
n=p*q and p and q are large primes. Besides, n is public and p and q are private. Let M be an integer
such that 0<M<n and $\phi$ (n) = (p − 1) (q − 1). Now consider the following equations.
I. M' = Me mod n
M = (M')d mod n
II. Ed = 1 mod n
III. ed = 1 mod $\phi$(n)
IV. M' = Me mod $\phi$(n)
M = (M')d mod $\phi$(n)
Which of the above equations correctly represent RSA
cryptosystem?
Reveal answer
Fill a bubble to check yourself
