summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/bn/bn_gcd.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libcrypto/bn/bn_gcd.c')
-rw-r--r--src/lib/libcrypto/bn/bn_gcd.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/lib/libcrypto/bn/bn_gcd.c b/src/lib/libcrypto/bn/bn_gcd.c
index f3a23701b1..0d8bdf07eb 100644
--- a/src/lib/libcrypto/bn/bn_gcd.c
+++ b/src/lib/libcrypto/bn/bn_gcd.c
@@ -1,4 +1,4 @@
1/* $OpenBSD: bn_gcd.c,v 1.19 2022/12/01 02:58:31 jsing Exp $ */ 1/* $OpenBSD: bn_gcd.c,v 1.20 2022/12/26 07:18:51 jmc 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 *
@@ -301,7 +301,7 @@ BN_mod_inverse_internal(BIGNUM *in, const BIGNUM *a, const BIGNUM *n, BN_CTX *ct
301 /* Binary inversion algorithm; requires odd modulus. 301 /* Binary inversion algorithm; requires odd modulus.
302 * This is faster than the general algorithm if the modulus 302 * This is faster than the general algorithm if the modulus
303 * is sufficiently small (about 400 .. 500 bits on 32-bit 303 * is sufficiently small (about 400 .. 500 bits on 32-bit
304 * sytems, but much more on 64-bit systems) */ 304 * systems, but much more on 64-bit systems) */
305 int shift; 305 int shift;
306 306
307 while (!BN_is_zero(B)) { 307 while (!BN_is_zero(B)) {