comment out in the previous commit

and for small 'a' also a couple of calls to
BN_mod_mul_montgomery(r, r, r, ...).

BN_mod_exp_atalla could be used.

BN_mod_exp. Call the regular atalla mod_exp operation instead.

Also, "make update" has added some missing functions to libeay.num,
updated the TABLE for the alpha changes, and updated thousands of
dependancies that have changed from recent commits.

marginally faster BN_mod_exp for 1024 bit exponents.

because we're only handling words anyway) in BN_mod_exp_mont_word
making it a little faster for very small exponents,
and adjust the performance gain estimate in CHANGES according
to slightly more thorough measurements.
(15% faster than BN_mod_exp_mont for "large" base,
20% faster than BN_mod_exp_mont for small base.)

like Malloc, Realloc and especially Free conflict with already existing names
on some operating systems or other packages.  That is reason enough to change
the names of the OpenSSL memory allocation macros to something that has a
better chance of being unique, like prepending them with OPENSSL_.

This change includes all the name changes needed throughout all C files.

choice of parameters) when they are needed.

proposed by Holger Reif

Remove one ampersand so the compiler may complain less.
Make rand() static so it will not conflict with the C RTL.
Make bug() static too, for good measure.

single fault:-) Needless to mention that bnbug.c posted couple of days
ago passes as well...

Looks like it fails when b is a power of 2, but I never get incorrect
results.

Apparently BN_div_recp reports an error for small divisors
(1,2,4,8,40).

I haven't got mismatches so far. If you can, please run the test
program for a few days (nohup divtest >out& or something), and if it
reports a mismatch, post the output.