n = pq where p and q are distinct primes.
phi, φ = (p-1)(q-1)
e < n such that gcd(e, phi)=1
d = e^-1 mod phi.
c = m^e mod n.
m = c^d mod n.
n = pq where p and q are distinct primes.
phi, φ = (p-1)(q-1)
e < n such that gcd(e, phi)=1
d = e^-1 mod phi.
c = m^e mod n.
m = c^d mod n.