Solution Found!
Show that Algorithm 5 uses O((log m)2 log n) bit
Chapter 4, Problem 58E(choose chapter or problem)
QUESTION:
Show that Algorithm 5 uses O((log m)2 log n) bit operations to find bn mod m.
Questions & Answers
QUESTION:
Show that Algorithm 5 uses O((log m)2 log n) bit operations to find bn mod m.
ANSWER:Solution:Step 1:The answer to this question we have to show that algorithm 5 uses O((log m)2 log n) bit operations to find bn mod m.