mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-11-13 11:42:38 +03: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. |
||
---|---|---|
.. | ||
ASN1 | ||
Authentication | ||
BigInt | ||
Checksum | ||
Cipher | ||
Hash | ||
NumberTheory | ||
PK | ||
CMakeLists.txt | ||
Verification.h |