diff options
| author | Theo Buehler <tb@cvs.openbsd.org> | 2023-04-07 23:03:33 +0000 |
|---|---|---|
| committer | Theo Buehler <tb@cvs.openbsd.org> | 2023-04-07 23:03:33 +0000 |
| commit | a97924fcd7364c130f1fc1130da23f855a404f03 (patch) | |
| tree | f473304ed9625d76f75d2a6482d2c3dd6ad45533 | |
| parent | 3e3932ea06ee7f73a891ee91bb4f10b5069bf536 (diff) | |
bn_mont: fix typo in comment divisable -> divisible
| -rw-r--r-- | lib/libcrypto/bn/bn_mont.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/libcrypto/bn/bn_mont.c b/lib/libcrypto/bn/bn_mont.c index 4b904c876ae..b327b89792b 100644 --- a/lib/libcrypto/bn/bn_mont.c +++ b/lib/libcrypto/bn/bn_mont.c @@ -1,4 +1,4 @@ -/* $OpenBSD: bn_mont.c,v 1.55 2023/03/27 10:25:02 tb Exp $ */ +/* $OpenBSD: bn_mont.c,v 1.56 2023/04/07 23:03:32 tb Exp $ */ /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) * All rights reserved. * @@ -518,7 +518,7 @@ bn_montgomery_reduce(BIGNUM *r, BIGNUM *a, BN_MONT_CTX *mctx) carry = 0; n0 = mctx->n0[0]; - /* Add multiples of the modulus, so that it becomes divisable by R. */ + /* Add multiples of the modulus, so that it becomes divisible by R. */ for (i = 0; i < n_len; i++) { v = bn_mul_add_words(&a->d[i], n->d, n_len, a->d[i] * n0); bn_addw_addw(v, a->d[i + n_len], carry, &carry, |