From nobody Tue Mar 15 17:55:01 2022 X-Original-To: dev-commits-src-branches@mlmmj.nyi.freebsd.org Received: from mx1.freebsd.org (mx1.freebsd.org [IPv6:2610:1c1:1:606c::19:1]) by mlmmj.nyi.freebsd.org (Postfix) with ESMTP id 44C311A1DADA; Tue, 15 Mar 2022 17:55:02 +0000 (UTC) (envelope-from git@FreeBSD.org) Received: from mxrelay.nyi.freebsd.org (mxrelay.nyi.freebsd.org [IPv6:2610:1c1:1:606c::19:3]) (using TLSv1.3 with cipher TLS_AES_256_GCM_SHA384 (256/256 bits) key-exchange X25519 server-signature RSA-PSS (4096 bits) server-digest SHA256 client-signature RSA-PSS (4096 bits) client-digest SHA256) (Client CN "mxrelay.nyi.freebsd.org", Issuer "R3" (verified OK)) by mx1.freebsd.org (Postfix) with ESMTPS id 4KJ1Jk1T3Zz5429; Tue, 15 Mar 2022 17:55:02 +0000 (UTC) (envelope-from git@FreeBSD.org) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=freebsd.org; s=dkim; t=1647366902; h=from:from:reply-to:subject:subject:date:date:message-id:message-id: to:to:cc:mime-version:mime-version:content-type:content-type: content-transfer-encoding:content-transfer-encoding; bh=39mNQdWxwcs1Hm5yAfG9UHULcCqJd96+OMzah27bC0Y=; b=HDID7x8/NKNeFlq96OrsoISkcX9Uj3iT4C+LJXuQoO9HUz8P5vUCaTbGDNcgbgikFi5ncW fc4wjq8XjldEe3o+nPmZAISB6PMAuXnljXuCQQMJAWwsoPpIg3v1g4p37EKcHmIEKazIVK 9XvRfxO6xwJwPp3eJ7Xq3o8dDjyfiM/lMREfkR7vMpXhF6jprhm4E8ghLanW0KnK7cx/XP JWNW+nqSQui0aFJ6WLfpLIMprfSjYcr1eCASYRLezdShth+qCprx9b2Xd4M8iQqkLmWFHG n8/w8iBULsa8f8M5uTUUAY583Hb7/sJYrdRB0BywCJlKnxfYxwemYg5nAC2qEA== Received: from gitrepo.freebsd.org (gitrepo.freebsd.org [IPv6:2610:1c1:1:6068::e6a:5]) (using TLSv1.3 with cipher TLS_AES_256_GCM_SHA384 (256/256 bits) key-exchange X25519 server-signature RSA-PSS (4096 bits) server-digest SHA256) (Client did not present a certificate) by mxrelay.nyi.freebsd.org (Postfix) with ESMTPS id 0D774265C1; Tue, 15 Mar 2022 17:55:02 +0000 (UTC) (envelope-from git@FreeBSD.org) Received: from gitrepo.freebsd.org ([127.0.1.44]) by gitrepo.freebsd.org (8.16.1/8.16.1) with ESMTP id 22FHt1Ab046820; Tue, 15 Mar 2022 17:55:01 GMT (envelope-from git@gitrepo.freebsd.org) Received: (from git@localhost) by gitrepo.freebsd.org (8.16.1/8.16.1/Submit) id 22FHt1x8046819; Tue, 15 Mar 2022 17:55:01 GMT (envelope-from git) Date: Tue, 15 Mar 2022 17:55:01 GMT Message-Id: <202203151755.22FHt1x8046819@gitrepo.freebsd.org> To: src-committers@FreeBSD.org, dev-commits-src-all@FreeBSD.org, dev-commits-src-branches@FreeBSD.org From: Gordon Tetlow Subject: git: 942b5e156d41 - releng/13.1 - Fix a bug in BN_mod_sqrt() that can cause it to loop forever. List-Id: Commits to the stable branches of the FreeBSD src repository List-Archive: https://lists.freebsd.org/archives/dev-commits-src-branches List-Help: List-Post: List-Subscribe: List-Unsubscribe: Sender: owner-dev-commits-src-branches@freebsd.org X-BeenThere: dev-commits-src-branches@freebsd.org MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8 Content-Transfer-Encoding: 8bit X-Git-Committer: gordon X-Git-Repository: src X-Git-Refname: refs/heads/releng/13.1 X-Git-Reftype: branch X-Git-Commit: 942b5e156d4126dfa370486972669347fc585575 Auto-Submitted: auto-generated ARC-Message-Signature: i=1; a=rsa-sha256; c=relaxed/relaxed; d=freebsd.org; s=dkim; t=1647366902; h=from:from:reply-to:subject:subject:date:date:message-id:message-id: to:to:cc:mime-version:mime-version:content-type:content-type: content-transfer-encoding:content-transfer-encoding; bh=39mNQdWxwcs1Hm5yAfG9UHULcCqJd96+OMzah27bC0Y=; b=DgOr6vXKkLzyZK6TyeE+DcII+3al7G3zk1KBw8ywoxuQ9WjsDvmzsN1Ik2AgDb9WZyR+nD h2CGzBjjM8rxpt6Q0/zIfZNB39QWd6icSM0Uzg6+Y1Tsn/Tyrw+q/MDOOq+gN3hUSfhEiG 694j/Cd9rbcoaT4BxKxsuKR5wTkS2I2YTaZWgjaO/a1PRgarDAo5BEk2mQDTVQJAmT8H1R mZguBNFdQJfYAZDAD3aBrxdG5o6HsfqhkR1pqRpjdyp1iVN0oQc0740TuMSgngfq99kI6N yaS9SbBwfgHZ4QyFSMko9EwkhZQQ0Ulz12INavsacYD58ZtmsXSnUjdaBy7YXQ== ARC-Seal: i=1; s=dkim; d=freebsd.org; t=1647366902; a=rsa-sha256; cv=none; b=psTVDZ0Q4Iudi+Bp/InJOlVCc8Ka322+9U+yoXCts4FZbrBtTrm0KYmVtiOmt1a7aUh3Qs cKWgtvypIGcuOpgWEVryAa7+JKVMzpTRhEGcOaE5LEglf42D9xX4YCjrNNOStNHTxtM4MX eZcjSw/+06uR+ppyCqUxI/k2An2gDBOVWTT6LMjQgHy/evvkSGYOO7ZqWDs074aeAh0Ohr oDox4SNeqBGUf1HCN7N1YWaTtkS5wYgcx11kGqU/p+AqjMh/FJdxLtXPoYiKoApiJh2BH9 q95fPhHaFS2jLCYIva3nZjKWb4/QuW+ZWv5Gdywj5OsEtHiNYe/FQEAMa+QP/Q== ARC-Authentication-Results: i=1; mx1.freebsd.org; none X-ThisMailContainsUnwantedMimeParts: N The branch releng/13.1 has been updated by gordon: URL: https://cgit.FreeBSD.org/src/commit/?id=942b5e156d4126dfa370486972669347fc585575 commit 942b5e156d4126dfa370486972669347fc585575 Author: Gordon Tetlow AuthorDate: 2022-03-15 16:48:59 +0000 Commit: Gordon Tetlow CommitDate: 2022-03-15 17:42:48 +0000 Fix a bug in BN_mod_sqrt() that can cause it to loop forever. Approved by: re (implicit) Obtained from: OpenSSL Project Security: CVE-2022-0778 Security: FreeBSD-SA-22:03.openssl (cherry picked from commit fdc418f15e92732a3551832bcb625ba9b47242df) (cherry picked from commit 5f3d952f6e6bce1151ab4a260c6922ba10d7a7ba) --- crypto/openssl/crypto/bn/bn_sqrt.c | 30 ++++++++++++++++++------------ crypto/openssl/doc/man3/BN_add.pod | 15 +++++++++++++-- 2 files changed, 31 insertions(+), 14 deletions(-) diff --git a/crypto/openssl/crypto/bn/bn_sqrt.c b/crypto/openssl/crypto/bn/bn_sqrt.c index 1723d5ded5a8..53b0f559855c 100644 --- a/crypto/openssl/crypto/bn/bn_sqrt.c +++ b/crypto/openssl/crypto/bn/bn_sqrt.c @@ -14,7 +14,8 @@ BIGNUM *BN_mod_sqrt(BIGNUM *in, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx) /* * Returns 'ret' such that ret^2 == a (mod p), using the Tonelli/Shanks * algorithm (cf. Henri Cohen, "A Course in Algebraic Computational Number - * Theory", algorithm 1.5.1). 'p' must be prime! + * Theory", algorithm 1.5.1). 'p' must be prime, otherwise an error or + * an incorrect "result" will be returned. */ { BIGNUM *ret = in; @@ -301,18 +302,23 @@ BIGNUM *BN_mod_sqrt(BIGNUM *in, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx) goto vrfy; } - /* find smallest i such that b^(2^i) = 1 */ - i = 1; - if (!BN_mod_sqr(t, b, p, ctx)) - goto end; - while (!BN_is_one(t)) { - i++; - if (i == e) { - BNerr(BN_F_BN_MOD_SQRT, BN_R_NOT_A_SQUARE); - goto end; + /* Find the smallest i, 0 < i < e, such that b^(2^i) = 1. */ + for (i = 1; i < e; i++) { + if (i == 1) { + if (!BN_mod_sqr(t, b, p, ctx)) + goto end; + + } else { + if (!BN_mod_mul(t, t, t, p, ctx)) + goto end; } - if (!BN_mod_mul(t, t, t, p, ctx)) - goto end; + if (BN_is_one(t)) + break; + } + /* If not found, a is not a square or p is not prime. */ + if (i >= e) { + BNerr(BN_F_BN_MOD_SQRT, BN_R_NOT_A_SQUARE); + goto end; } /* t := y^2^(e - i - 1) */ diff --git a/crypto/openssl/doc/man3/BN_add.pod b/crypto/openssl/doc/man3/BN_add.pod index dccd4790ede7..1f5e37a4d183 100644 --- a/crypto/openssl/doc/man3/BN_add.pod +++ b/crypto/openssl/doc/man3/BN_add.pod @@ -3,7 +3,7 @@ =head1 NAME BN_add, BN_sub, BN_mul, BN_sqr, BN_div, BN_mod, BN_nnmod, BN_mod_add, -BN_mod_sub, BN_mod_mul, BN_mod_sqr, BN_exp, BN_mod_exp, BN_gcd - +BN_mod_sub, BN_mod_mul, BN_mod_sqr, BN_mod_sqrt, BN_exp, BN_mod_exp, BN_gcd - arithmetic operations on BIGNUMs =head1 SYNOPSIS @@ -36,6 +36,8 @@ arithmetic operations on BIGNUMs int BN_mod_sqr(BIGNUM *r, BIGNUM *a, const BIGNUM *m, BN_CTX *ctx); + BIGNUM *BN_mod_sqrt(BIGNUM *in, BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); + int BN_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p, BN_CTX *ctx); int BN_mod_exp(BIGNUM *r, BIGNUM *a, const BIGNUM *p, @@ -87,6 +89,12 @@ L. BN_mod_sqr() takes the square of I modulo B and places the result in I. +BN_mod_sqrt() returns the modular square root of I such that +C. The modulus I

must be a +prime, otherwise an error or an incorrect "result" will be returned. +The result is stored into I which can be NULL. The result will be +newly allocated in that case. + BN_exp() raises I to the I

-th power and places the result in I (C). This function is faster than repeated applications of BN_mul(). @@ -108,7 +116,10 @@ the arguments. =head1 RETURN VALUES -For all functions, 1 is returned for success, 0 on error. The return +The BN_mod_sqrt() returns the result (possibly incorrect if I

is +not a prime), or NULL. + +For all remaining functions, 1 is returned for success, 0 on error. The return value should always be checked (e.g., C). The error codes can be obtained by L.