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.
Thursday, November 04, 2004
Summary of RSA
Posted by Basel Zhang at 12:21 PM
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment