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).
This commit is contained in:
Andy Polyakov 2000-02-15 13:50:02 +00:00
parent 207c7df746
commit ea96c4bc7f

View File

@ -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;