From: Andy Polyakov <appro@openssl.org>
Date: Tue, 15 Feb 2000 13:50:02 +0000 (+0000)
Subject: test_mont was exercising 100-bit multiplication modulus X*I-bit, where
X-Git-Tag: OpenSSL_0_9_5beta1~68
X-Git-Url: https://git.openssl.org/?p=openssl.git;a=commitdiff_plain;h=ea96c4bc7f4983348d45257d4453490330404b18;hp=207c7df746ca5c3cad6ce71e6cf2263d4183d8be

test_mont was exercising 100-bit multiplication modulus X*I-bit, where
X is 5120 on 32-bit and 151552 on 64-bit architectures and I varies
from 0 to 4. As result the test was *unreasonably* slow and virtually
impossible to complete on 64-bit architectures (e.g. IRIX bc couldn't
even swallow such long lines).
---

diff --git a/crypto/bn/bntest.c b/crypto/bn/bntest.c
index 9276a079d0..d64d512e9a 100644
--- a/crypto/bn/bntest.c
+++ b/crypto/bn/bntest.c
@@ -615,7 +615,7 @@ int test_mont(BIO *bp, BN_CTX *ctx)
 	BN_rand(&b,100,0,0); /**/
 	for (i=0; i<num2; i++)
 		{
-		int bits = (100%BN_BITS2+1)*BN_BITS2*i*BN_BITS2;
+		int bits = (200*(i+1))/num2;
 
 		if (bits == 0)
 			continue;