On Fri, Nov 10, 2000 at 11:27:03PM +0100, Richard Levitte - VMS Whacker wrote:
[...]
>> Constifying just the BN_mod_exp's should be enough for a lot of that.
>> If necessary, we can still add a constified variant of BN_mul that
>> copies its arguments or uses a multiplication algorithm that does not
>> require expansion. (You certainly don't want an implicit BIGNUM
>> expansion to happen when sharing constants between threads.
>> Sure, race conditions can be very interesting, but still I don't like
>> to have them in my programs :-)
> Only problem with BN_mul is that copying of the argument is exactly
> what the current implementation does, and only when absolutely needed,
> and that gave a 15% performance decrease.
That's why I said, "add a constified variant of BN_mul." The
exponentiation functions would still use the standard version of
BN_mul. (Same for BN_square and any other similar stuff.)
--
Bodo M�ller <[EMAIL PROTECTED]>
PGP http://www.informatik.tu-darmstadt.de/TI/Mitarbeiter/moeller/0x36d2c658.html
* TU Darmstadt, Theoretische Informatik, Alexanderstr. 10, D-64283 Darmstadt
* Tel. +49-6151-16-6628, Fax +49-6151-16-6036
______________________________________________________________________
OpenSSL Project http://www.openssl.org
Development Mailing List [EMAIL PROTECTED]
Automated List Manager [EMAIL PROTECTED]
