MCQOPTIONS
Bookmark
Saved Bookmarks
→
Discrete Mathematics
→
Inference
→
The time complexity to perform the modular exponen...
1.
The time complexity to perform the modular exponentiation of a cg (mod m).
A.
O(m+a)
B.
O(a*g)
C.
O(gm)
D.
O(g)
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Determine the value of x, where y = 7, e = 12 and n = 566 using modular exponentiation method (x ye (mod n)).
In cryptography system, the value of z in x ze (mod m) should be at least ______
The time complexity to perform the modular exponentiation of a cg (mod m).
If there is a unique prime number p1 then a finite field F has the property of ______________
If the multiplicative inverse of 53 modulo 21 exists, then which of the following is true?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies