The previous implementation of `ModularInverse` was flaky and did not compute the correct value in many occasions, especially with big numbers like in RSA. Also added a bunch of tests with big numbers. |
||
|---|---|---|
| .. | ||
| BitwiseOperations.cpp | ||
| Division.cpp | ||
| GCD.cpp | ||
| ModularInverse.cpp | ||
| ModularPower.cpp | ||
| Multiplication.cpp | ||
| SimpleOperations.cpp | ||
| UnsignedBigIntegerAlgorithms.h | ||