1.

The time complexity to perform the modular exponentiation of a ≡ c^g (mod m).(a) O(m+a)(b) O(a*g)(c) O(gm)(d) O(g)I got this question in homework.Query is from Number Theory topic in portion Number Theory and Cryptography of Discrete Mathematics

Answer»

The CORRECT option is (d) O(g)

For explanation I would say: The modular EXPONENTIATION completely depends on the operating SYSTEM environment and the PROCESSOR for its performance. The above said method REQUIRES a time complexity of O(g) for its completion.



Discussion

No Comment Found

Related InterviewSolutions