City Guilds Model Questions Vol1 2017 Information Technology Question 45
Practice objective / multiple choice question 45 from the 2017 City Guilds Model Questions Vol1 Information Technology examination.
Using RSA, two prime numbers \(p = 61\) and \(q = 53\) are chosen. Let \(n = p\times q\) and \(\phi = (p-1)(q-1)\). Choose the smallest public exponent \(e > 1\) that (i) is relatively prime to \(\phi\) and (ii) has exactly three 1's in its binary representation. (iii) Compute the corresponding private exponent \(d\). Finally, decrypt the ciphertext \(c = 2790\) to obtain the plaintext \(m\).
Answer Options
About This Question
This is City Guilds Model Questions Vol1 2017 Information Technology Question 45. It is one of the objective questions from the 2017 City Guilds Model Questions Vol1 Information Technology examination.
Difficulty level: Hard .
Master the Exam!
You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.