From 03c435fef76995afbdc48b56ab2098da7b3fbe53 Mon Sep 17 00:00:00 2001 From: tb Date: Fri, 15 Jul 2022 06:19:27 +0000 Subject: [PATCH] Expand the comment explaining the for loop with bn_lucas_step() a bit. --- lib/libcrypto/bn/bn_bpsw.c | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/lib/libcrypto/bn/bn_bpsw.c b/lib/libcrypto/bn/bn_bpsw.c index f189571ebe0..ca63410373e 100644 --- a/lib/libcrypto/bn/bn_bpsw.c +++ b/lib/libcrypto/bn/bn_bpsw.c @@ -1,4 +1,4 @@ -/* $OpenBSD: bn_bpsw.c,v 1.2 2022/07/15 06:14:17 tb Exp $ */ +/* $OpenBSD: bn_bpsw.c,v 1.3 2022/07/15 06:19:27 tb Exp $ */ /* * Copyright (c) 2022 Martin Grenouilloux * Copyright (c) 2022 Theo Buehler @@ -192,8 +192,8 @@ bn_strong_lucas_test(int *is_prime, const BIGNUM *n, const BIGNUM *D, } /* - * If any V_{k * 2^r} is zero for 1 <= r < s then n is a strong Lucas - * pseudoprime. + * Calculate the Lucas terms U_{k * 2^r}, V_{k * 2^r} for 1 <= r < s. + * If any V_{k * 2^r} is zero then n is a strong Lucas pseudoprime. */ for (r = 1; r < s; r++) { if (!bn_lucas_step(U, V, 0, D, n, ctx)) -- 2.20.1