Step -1.    Select a value of e from a random set of prime numbers

Step -2. repeat

Step -3. p ← genprime(k/2)

Step -4. until (p mod e) ≠ 1

Step -5. repeat

a. q ← genprime(k - k/2)

Step -6. until (q mod e) ≠ 1

a. N ← pq

b. L ← (p-1)(q-1)

c. d ← mod Inv(e, L)

Step -7. return (N, e, d)