From: Ulf Möller <ulf@openssl.org>
Date: Wed, 5 Sep 2001 04:45:45 +0000 (+0000)
Subject: bn_sqr bug fix as in main
X-Git-Tag: OpenSSL_0_9_6c~125
X-Git-Url: https://git.librecmc.org/?a=commitdiff_plain;h=3f345dc653a4e4314ab9be97274623296a866cf4;p=oweals%2Fopenssl.git

bn_sqr bug fix as in main
---

diff --git a/CHANGES b/CHANGES
index 1fd2e2841a..ddf9e6ea5e 100644
--- a/CHANGES
+++ b/CHANGES
@@ -4,6 +4,9 @@
 
  Changes between 0.9.6b and 0.9.6c  [XX xxx XXXX]
 
+  *) BN_sqr() bug fix.
+     [Ulf Möller, reported by Jim Ellis <jim.ellis@cavium.com>]
+
   *) Rabin-Miller test analyses assume uniformly distributed witnesses,
      so use BN_pseudo_rand_range() instead of using BN_pseudo_rand()
      followed by modular reduction.
diff --git a/crypto/bn/bn_sqr.c b/crypto/bn/bn_sqr.c
index 75f4f38392..09bd3377bf 100644
--- a/crypto/bn/bn_sqr.c
+++ b/crypto/bn/bn_sqr.c
@@ -245,7 +245,7 @@ printf(" bn_sqr_recursive %d * %d\n",n2,n2);
 	if (!zero)
 		bn_sqr_recursive(&(t[n2]),t,n,p);
 	else
-		memset(&(t[n2]),0,n*sizeof(BN_ULONG));
+		memset(&(t[n2]),0,n2*sizeof(BN_ULONG));
 	bn_sqr_recursive(r,a,n,p);
 	bn_sqr_recursive(&(r[n2]),&(a[n]),n,p);