Show that modular exponentiation of (mod m) is of log complexity (O(logn)). All logs are base 2. You may ignore the reduction by modulo computations in formulating your argument.
Follow Math Help Forum on Facebook and Google+
View Tag Cloud
LinkBack URL
About LinkBacks(mod m) is of log complexity (O(logn)). All logs are base 2. You may ignore the reduction by modulo computations in formulating your argument.
