The time complexity to perform the modular exponentiation of a ≡ cg (mod m).

The time complexity to perform the modular exponentiation of a ≡ cg (mod m). Correct Answer O(g)

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.

Related Questions

Which of these distinctions of modular programs over non modular are true?
If a ≡ b mod(n) and b ≡ c mod(n) , then