mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2025-06-10 12:21:52 +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. |
||
---|---|---|
.. | ||
ModularFunctions.cpp | ||
ModularFunctions.h |