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 (bⁿ mod m),$$0 \le b,n \le m$$?

The minimum positive integer p such that (3^p modulo 17) = 1 is

Consider the following two statements:

i. A hash function (these are often used for computing digital signatures) is an injective function.
ii. encryption technique such as DES performs a permutation on the elements of its input alphabet.

Which one of the following options is valid for the above two statements?

Match the following:

List - I

(P) SMTP
(Q) BGP
(R) TCP
(S) PPP

List - II

(1) Application layer
(2) Transport layer
(3) Data link layer
(4) Network layer
(5) Physical layer