diff options
| author | Michael Brown <mcb30@ipxe.org> | 2024-11-25 15:59:22 +0000 |
|---|---|---|
| committer | Michael Brown <mcb30@ipxe.org> | 2024-11-28 15:06:01 +0000 |
| commit | 83ac98ce22b5b735cba4d1a21db8cc8e8648dfa4 (patch) | |
| tree | e226bd3863e9b0a1d666a7f5656431f6b069b881 /src/crypto/rsa.c | |
| parent | 4f7dd7fbba205d413cf9b989f7cdc928fa02caf2 (diff) | |
| download | ipxe-83ac98ce22b5b735cba4d1a21db8cc8e8648dfa4.tar.gz | |
[crypto] Use Montgomery reduction for modular exponentiation
Speed up modular exponentiation by using Montgomery reduction rather
than direct modular reduction.
Montgomery reduction in base 2^n requires the modulus to be coprime to
2^n, which would limit us to requiring that the modulus is an odd
number. Extend the implementation to include support for
exponentiation with even moduli via Garner's algorithm as described in
"Montgomery reduction with even modulus" (Koç, 1994).
Since almost all use cases for modular exponentation require a large
prime (and hence odd) modulus, the support for even moduli could
potentially be removed in future.
Signed-off-by: Michael Brown <mcb30@ipxe.org>
Diffstat (limited to 'src/crypto/rsa.c')
| -rw-r--r-- | src/crypto/rsa.c | 3 |
1 files changed, 1 insertions, 2 deletions
diff --git a/src/crypto/rsa.c b/src/crypto/rsa.c index 19472c121..44041da3e 100644 --- a/src/crypto/rsa.c +++ b/src/crypto/rsa.c @@ -109,8 +109,7 @@ static int rsa_alloc ( struct rsa_context *context, size_t modulus_len, unsigned int size = bigint_required_size ( modulus_len ); unsigned int exponent_size = bigint_required_size ( exponent_len ); bigint_t ( size ) *modulus; - bigint_t ( exponent_size ) *exponent; - size_t tmp_len = bigint_mod_exp_tmp_len ( modulus, exponent ); + size_t tmp_len = bigint_mod_exp_tmp_len ( modulus ); struct { bigint_t ( size ) modulus; bigint_t ( exponent_size ) exponent; |