mirror of
https://github.com/RGBCube/serenity
synced 2025-10-24 16:02:06 +00:00
485adb5e29
This algorithm allows for much faster computations of modular powers (around a 5x-10x speedup of the Crypto test). However, it is only valid for odd modulo values, and therefore the old algorithm must be kept for computations involving even modulo values. |
||
|---|---|---|
| .. | ||
| ModularFunctions.cpp | ||
| ModularFunctions.h | ||