Show that Algorithm 5 uses O((log mi 10g n) bit operations
Chapter 3, Problem 3.6.56(choose chapter or problem)
Show that Algorithm 5 uses O((log mi 10g n) bit operations to find b n mod m.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer