GATE 2009 CS – Question 46
In RSA the private and public keys are (e, n) and (d, n), respectively, where n=pq for large primes p, q; n is public, p, q private. Let $0<M<n$ and $\phi(n)=(p-1)(q-1)$. Which equations correctly represent RSA?
I. $M\prime=M^e\bmod n$, $M=(M\prime)^d\bmod n$.
II. $ed\equiv1\pmod n$.
III. $ed\equiv1\pmod{\phi(n)}$.
IV. $M\prime=M^e\bmod\phi(n)$, $M=(M\prime)^d\bmod\phi(n)$.
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: (B) I and III
Explanation
We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort