The Basics of RSA (cont’d)
Public key is {e,n}, private key is {d,n}; p,q no longer needed but must not be disclosed
With a message m and ciphertext c:
- Encryption: c = m^e mod n
- Decryption: m = c^d mod n
- works because m^(ed) = m & m<n (reqd)
If you can factor n (to get p,q), you can break RSA, but we think this is hard