Does the fast modular exponentiation algorithm computes bⁿ mod m in only about log₂(n) steps. this makes it practical even when n is large.