Exponentiation is a heavily used operation in public key cryptography. Which…
GATE · 2007 · IT
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 ?
- A.
O(logn)
- B.
O(√n)
- C.
O(n/logn)
- D.
O(n)
Attempted by 172 students.
Sign up free to check your answer
Sign up freeLoading lesson…