Select two very large prime number p and q. The number of bits needed to represent p and q might be 1024. Compute n=pa q(n) = (p-1) (q-1). The formula for g(n) is owing to Theorem: The number of elements in z = {[1]n, [2]n [n 1]n } is given by Euler's totient function, which is (n) = n Ilppln(1 - 5), where the product is over all primes that divide n, including n ifn is prime. Choose a small prime number as an encryption component g, that is relatively prime to p(n). That means, ged(g. (n)) = 1, i.e.. ged(g. (p-1)(-1)) = 1