Am Sonntag, den 09.10.2005, 12:37 +0200 schrieb Nils Larsch: > On Fri, Oct 07, 2005, Christian Kirbach wrote:
> > as part of my Diploma Thesis I am about to integrate my own > > implementation of the multiplication of two large integers. > > I'd like to replace the bigint multiplication of OpenSSL's RSA > > implementation. > well you could of course modify the crypto/bn code, however this > requires some knowledge of the internals of the bignum library. If > you just want to use your code for signing etc. you should perhaps > try to write an engine (see engines/e_gmp.c for an example). Thanks for responding. Of course an engine would be a clean solution, but all I really want to replace is the multiplication of two big integers. I've decided to do a brief proof-of-concept hack. If I analysed correctly I need to replace bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb) in crypto/bn/bn_mul.c with my own implementation. -- Christian Kirbach <[EMAIL PROTECTED]> PGP key 1FE120E3 ______________________________________________________________________ OpenSSL Project http://www.openssl.org Development Mailing List openssl-dev@openssl.org Automated List Manager [EMAIL PROTECTED]
