Hi i need help with the complexity of this algorithms
Based on the algorithm of [Cor 2009], to calculate a ^ b mod n, where a, b and n are positive integers:
1) What is the Complexity Complexity of this algorithm?
2) Write an algorithm where "a" is a square matrix ( Matrix_ModExp(Matrix a, int b, int c) ) and calculate the complexity of this algorithm
3) How Matrix Modular Exponentiation can be used to calculate the Fibonacci sequence when:
thx for any help, Regards