Inan RSA cryptosystem, n = pq where p and q are prime numbers. Youknow n but you do not know the factors p and q. Suppose that youknow φ(n), where φ is Euler’s totient function. Show how to computep and q from n and φ(n). Using this method, find p and q from n =2881 and φ(n) = 2772.
Answer
2XL 43.6 (43, 67 ay