Which of the following algorithms has better computational complexity – McqOptions

MCQOPTIONS

1.	Which of the following algorithms has better computational complexity than standard division algorithms?
A.	Montgomery algorithm
B.	Classical modular exponentiation algorithm
C.	ASM algorithm
D.	FSM algorithm
Answer» C. ASM algorithm

Discussion

No Comment Found

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 ______
According to congruence relation, find the remainder of 56 mod 24.
The time complexity to perform the modular exponentiation of a ≡ cg (mod m).a) O(m+
Evaluate the expression 6359 mod 320.
If there is a unique prime number p1 then a finite field F has the property of ______________
Which of the following methods uses the concept that exponentiation is computationally inexpensive in the finite field?
Which of the following algorithms has better computational complexity than standard division algorithms?
A multiplicative monoid defines the property of exponentiation with ________
If the multiplicative inverse of “53 modulo 21” exists, then which of the following is true?