GATE CSE 2009 || Computer Networks || GATE Insights Version: CSE
Автор: GATE Insights Version: CSE
Загружено: 2021-11-22
Просмотров: 220
Описание:
Planning to take coaching on Unacademy
http://bit.ly/gate_unacademy
or
https://unacademy.com/
here is a code for 10% off PLUS1BPK1
Telegram Notification Group link:-
https://t.me/joinchat/X5egW_cvdt9kMGY1
Telegram discussion Group link:-
https://t.me/joinchat/VCyGUmVq8RNkMzhl
Downloads resources from here
https://education4fun.com/gate-cse/
MCQ (Single Correct Answer)
GATE CSE 2009
In the RSA public key cryptosystem, the private and public keys are (e, n) and (d, n) respectively, where n = p*q and p and q are large primes. Besides, n is public and p and q are private. Let M be an integer such that 0 LESS THAN M LESS THAN n and f(n) = (p- 1)(q-1). Now consider the following equations.
M’= Me mod n M = (M’)d mod n
II. ed ≡ 1 mod n
III. ed ≡ 1 mod f(n)
IV. M’= Me mod f(n) M = (M’)d mod f(n)
Which of the above equations correctly represent RSA cryptosystem?
(A) I and II(B) I and III(C) II and IV(D) III and IV
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
