Lab P9
import java.math.BigInteger;
import java.util.Random;
BigInteger n = p.multiply(q);
// Step 3: Choose a public key 'e' such that 1 < e < φ(n) and gcd(e, φ(n)) = 1
e = e.add(BigInteger.ONE);
BigInteger d = e.modInverse(phi);