Exponentiation is a heavily used operation in public key cryptography. Which…

PYQ GATE 2007

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≤b,n≤m ?

  1. A.

    O(logn)

  2. B.

    O(√n)

  3. C.

    O(n/logn)

  4. D.

    O(n)

Attempted by 214 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…