diff options
-rw-r--r-- | src/lib/libcrypto/bn/bn_mont.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/lib/libcrypto/bn/bn_mont.c b/src/lib/libcrypto/bn/bn_mont.c index 4b904c876a..b327b89792 100644 --- a/src/lib/libcrypto/bn/bn_mont.c +++ b/src/lib/libcrypto/bn/bn_mont.c | |||
@@ -1,4 +1,4 @@ | |||
1 | /* $OpenBSD: bn_mont.c,v 1.55 2023/03/27 10:25:02 tb Exp $ */ | 1 | /* $OpenBSD: bn_mont.c,v 1.56 2023/04/07 23:03:32 tb Exp $ */ |
2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) | 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
3 | * All rights reserved. | 3 | * All rights reserved. |
4 | * | 4 | * |
@@ -518,7 +518,7 @@ bn_montgomery_reduce(BIGNUM *r, BIGNUM *a, BN_MONT_CTX *mctx) | |||
518 | carry = 0; | 518 | carry = 0; |
519 | n0 = mctx->n0[0]; | 519 | n0 = mctx->n0[0]; |
520 | 520 | ||
521 | /* Add multiples of the modulus, so that it becomes divisable by R. */ | 521 | /* Add multiples of the modulus, so that it becomes divisible by R. */ |
522 | for (i = 0; i < n_len; i++) { | 522 | for (i = 0; i < n_len; i++) { |
523 | v = bn_mul_add_words(&a->d[i], n->d, n_len, a->d[i] * n0); | 523 | v = bn_mul_add_words(&a->d[i], n->d, n_len, a->d[i] * n0); |
524 | bn_addw_addw(v, a->d[i + n_len], carry, &carry, | 524 | bn_addw_addw(v, a->d[i + n_len], carry, &carry, |