How to implement modular exponentiation?
问题 I am trying to calculate something like this: a^b mod c, where all three numbers are large. Things I've tried: Python's pow() function is taking hours and has yet to produce a result. (if someone could tell me how it's implemented that would be very helpful!) A right-to-left binary method that I implemented, with O(log e) time, would take about 30~40 hours (don't wanna wait that long). Various recursion methods are producing segmentation faults (after I changed the recursion limits) Any