Discussion @ 1141. RSA Attack @ Timus Online Judge

Sbreg How to do it fast? [1] // Problem 1141. RSA Attack 19 Jun 2003 00:03

My programm find secret key d (e*d mod (p-1)*(q-1)=1) and compute c^d mod n (=m) with "russian peasant method". But 0.981 sec is very bad.

UNKNOWN_LAMER Re: How to do it fast? // Problem 1141. RSA Attack 10 Aug 2004 18:21

I have the same algorithm and AC program in 0.421 sec. How did all these people solve the problem better than in 0.1 sec? Maybe some idea of optimization?

Discussion of Problem 1141. RSA Attack