[Author Prev][Author Next][Thread Prev][Thread Next][Author Index][Thread Index]
Big Mod algorithm
- To: <linuxgames@sunsite.dk>
- Subject: Big Mod algorithm
- From: Igor Cabral Corrêa <imortis@uol.com.br>
- Date: Sun, 17 Aug 2003 14:11:19 -0300
- Delivered-to: archiver@seul.org
- Delivered-to: mailing list linuxgames@sunsite.dk
- Delivery-date: Sun, 17 Aug 2003 13:08:26 -0400
- Mailing-list: contact linuxgames-help@sunsite.dk; run by ezmlm
- Reply-to: linuxgames@sunsite.dk
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