closed by
687 views
0 votes
0 votes
closed as a duplicate of: GATE IT 2007 | Question: 17

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^n mod m,0<=b,n<=m?

a)O(log n)

b)O(sqrt(n))

c)O(n/log n)

d)O(n)

please explain..

 bnmodm,0b,nmbnmodm,0≤b,n≤m ? 

closed by

Related questions

0 votes
0 votes
1 answer
1
go_editor asked Nov 20, 2020
1,893 views
Using ‘RSA’ public key cryptosystem, if $p=3$, $q=11$ and $d=7$, find the value of $e$ and encrypt the number $’19’$$20, 19$$33,11$$3, 28$$77, 28$