RSA

Steps:

1. Choose two random k-bit prime numbers p and q (p \neq q)
2. Calculate n = p \cdot q
3. Calculate \varphi(n) = (p-1)(q-1)
4. Choose an e with gcd(e, \varphi(n)) = 1
5. Calculate d with ed \equiv 1 \pmod{\varphi(n)} using the extended euclidean algorithm

Parameter:

• e: Public RSA exponent
• d: Secret RSA exponent
• n: RSA modulus
• (e,n): Public key
• d or (d,p,q): Secret key