[Author Prev][Author Next][Thread Prev][Thread Next][Author Index][Thread Index]

Big Mod algorithm



Hi for all!

Someone knows where can I find a fast algorithm for calculating mod of great powers? (a^e%n, with ' e ' great, but in range of unsigned long int, and m in range of unsigned short int)

Thanks,
Igor C. Corrêa