Question

In RSA, we select a value ‘e’ such that it lies between 0 and Ф(n) and it is relatively prime to Ф(n).

(a) True

(b) False

I had been asked this question in examination.

My question is from Knapsack/ Merkle topic in section Public Key Cryptography and RSA of Cryptograph & Network Security

Answer 1

Correct answer is (b) False

To explain I would say: gcd(e, Ф(n))=1;  and   1 < e < Ф(n).