Key Generation Procedure

1

Generate two large prime numbers p and q. ?greatest common divisor (gcd) (p, q) = 1

2

Compute n = p * q

3

Compute Euler’s Totient Function ø(n) = (p − 1) * (q − 1) where ø = totient

4

Choose public key integer e, where 1< e < ø(n) ?gcd(ø(n), e) = 1

5

Compute private key integer d, d = e − 1 mod ø(n)

6

Public key is (e, n) and private-key is (d, n)