1
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
Exponentiation is a heavily used operation in public key cryptography. Which of the following options is the tightest upper bound on the number of multiplications required to compute (bn mod m),$$0 \le b,n \le m$$?
2
GATE CSE 2004
MCQ (Single Correct Answer)
+1
-0.3
A sender is employing public key Cryptography to send a secret message to a receiver. Which one of the following statement is true?
Questions Asked from Network Security (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages