Suppose that (n, e) is an RSA encryption key, with n=pq where p and q are large primes, and gcd(e,(p−1)(q−1))=1.
a) What is the significance of n in the RSA encryption key?
b) Explain the role of e in the RSA encryption process.
c) Why is it important for e to be relatively prime to (p−1)(q−1)?
d) How does the choice of prime numbers p and q impact the security of the RSA algorithm?
