mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2025-06-17 15:51:55 +00:00
f49a55d089
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.
36 lines
1.2 KiB
C++
36 lines
1.2 KiB
C++
/*
|
|
* Copyright (c) 2020, Ali Mohammad Pur <mpfard@serenityos.org>
|
|
* Copyright (c) 2020-2021, Dex♪ <dexes.ttp@gmail.com>
|
|
* Copyright (c) 2024, Altomani Gianluca <altomanigianluca@gmail.com>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#include "UnsignedBigIntegerAlgorithms.h"
|
|
|
|
namespace Crypto {
|
|
|
|
void UnsignedBigIntegerAlgorithms::modular_inverse_without_allocation(
|
|
UnsignedBigInteger const& a,
|
|
UnsignedBigInteger const& b,
|
|
UnsignedBigInteger& result,
|
|
UnsignedBigInteger& temp_y,
|
|
UnsignedBigInteger& temp_gcd,
|
|
UnsignedBigInteger& temp_quotient,
|
|
UnsignedBigInteger& temp_1,
|
|
UnsignedBigInteger& temp_2,
|
|
UnsignedBigInteger& temp_shift_result,
|
|
UnsignedBigInteger& temp_shift_plus,
|
|
UnsignedBigInteger& temp_shift,
|
|
UnsignedBigInteger& temp_r,
|
|
UnsignedBigInteger& temp_s,
|
|
UnsignedBigInteger& temp_t)
|
|
{
|
|
extended_GCD_without_allocation(a, b, result, temp_y, temp_gcd, temp_quotient, temp_1, temp_2, temp_shift_result, temp_shift_plus, temp_shift, temp_r, temp_s, temp_t);
|
|
|
|
divide_without_allocation(result, b, temp_quotient, temp_1);
|
|
add_into_accumulator_without_allocation(temp_1, b);
|
|
divide_without_allocation(temp_1, b, temp_quotient, result);
|
|
}
|
|
|
|
}
|