|
|
вернуться в форум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. 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? |
|
|
