From ec5bc199962f5a8326ac405f524336e907e02efb Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Manuel=20P=C3=A9gouri=C3=A9-Gonnard?= Date: Tue, 9 Dec 2025 09:16:25 +0100 Subject: [PATCH] Fix some typos in comments MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Signed-off-by: Manuel Pégourié-Gonnard --- library/rsa.c | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/library/rsa.c b/library/rsa.c index a706d90c83..2f3e3d93e3 100644 --- a/library/rsa.c +++ b/library/rsa.c @@ -1269,7 +1269,7 @@ cleanup: #if !defined(MBEDTLS_RSA_NO_CRT) /* - * Compute T such that T = TP mod P and T = TP mod Q. + * Compute T such that T = TP mod P and T = TQ mod Q. * (This is the Chinese Remainder Theorem - CRT.) * * WARNING: uses TP as a temporary, so its value is lost! @@ -1343,7 +1343,7 @@ cleanup: goto cleanup; } - /* Generate Ap in [1, Q) and compute Bq = Aq^-1 mod P */ + /* Generate Aq in [1, Q) and compute Bq = Aq^-1 mod Q */ MBEDTLS_MPI_CHK(mbedtls_mpi_random(&Aq, 1, &ctx->Q, f_rng, p_rng)); MBEDTLS_MPI_CHK(mbedtls_mpi_gcd_modinv_odd(&G, &Bq, &Aq, &ctx->Q)); if (mbedtls_mpi_cmp_int(&G, 1) != 0) {