In RSA, Ф(n) = _______ in terms of p and q.
(a) (p)/(q)
(b) (p)(q)
(c) (p-1)(q-1)
(d) (p+1)(q+1)
I have been asked this question during an interview.
Origin of the question is Knapsack/ Merkle in section Public Key Cryptography and RSA of Cryptograph & Network Security