In the RSA algorithm, we select 2 random large values ‘p’ and ‘q’. Which of the following is the property of ‘p’ and ‘q’?
(a) p and q should be divisible by Ф(n)
(b) p and q should be co-prime
(c) p and q should be prime
(d) p/q should give no remainder
The question was asked in an online interview.
The above asked question is from Knapsack/ Merkle topic in portion Public Key Cryptography and RSA of Cryptograph & Network Security