RSA Key Generation

1 Choose Primes

Prime p: Prime q:

2 Compute n = p × q

Modulus n:

This is the modulus used in both public and private keys

3 Compute φ(n)

Euler's Totient:

φ(n) = (p-1)(q-1)

4 Choose e

Public Exponent:

1 < e < φ(n), gcd(e, φ(n)) = 1

5 Compute d

Private Exponent:

d ≡ e⁻¹ (mod φ(n))