mirror of
https://github.com/RGBCube/serenity
synced 2025-06-30 07:22:13 +00:00
![]() 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. |
||
---|---|---|
.. | ||
BitwiseOperations.cpp | ||
Division.cpp | ||
GCD.cpp | ||
ModularInverse.cpp | ||
ModularPower.cpp | ||
Multiplication.cpp | ||
SimpleOperations.cpp | ||
UnsignedBigIntegerAlgorithms.h |