summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--src/lib/libcrypto/bn/bn_bpsw.c6
1 files changed, 3 insertions, 3 deletions
diff --git a/src/lib/libcrypto/bn/bn_bpsw.c b/src/lib/libcrypto/bn/bn_bpsw.c
index f189571ebe..ca63410373 100644
--- a/src/lib/libcrypto/bn/bn_bpsw.c
+++ b/src/lib/libcrypto/bn/bn_bpsw.c
@@ -1,4 +1,4 @@
1/* $OpenBSD: bn_bpsw.c,v 1.2 2022/07/15 06:14:17 tb Exp $ */ 1/* $OpenBSD: bn_bpsw.c,v 1.3 2022/07/15 06:19:27 tb Exp $ */
2/* 2/*
3 * Copyright (c) 2022 Martin Grenouilloux <martin.grenouilloux@lse.epita.fr> 3 * Copyright (c) 2022 Martin Grenouilloux <martin.grenouilloux@lse.epita.fr>
4 * Copyright (c) 2022 Theo Buehler <tb@openbsd.org> 4 * Copyright (c) 2022 Theo Buehler <tb@openbsd.org>
@@ -192,8 +192,8 @@ bn_strong_lucas_test(int *is_prime, const BIGNUM *n, const BIGNUM *D,
192 } 192 }
193 193
194 /* 194 /*
195 * If any V_{k * 2^r} is zero for 1 <= r < s then n is a strong Lucas 195 * Calculate the Lucas terms U_{k * 2^r}, V_{k * 2^r} for 1 <= r < s.
196 * pseudoprime. 196 * If any V_{k * 2^r} is zero then n is a strong Lucas pseudoprime.
197 */ 197 */
198 for (r = 1; r < s; r++) { 198 for (r = 1; r < s; r++) {
199 if (!bn_lucas_step(U, V, 0, D, n, ctx)) 199 if (!bn_lucas_step(U, V, 0, D, n, ctx))