On Fri, Oct 07, 2005, Christian Kirbach wrote: > hi folks, > > 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. > > I've had a first look at the documentation and sources and wonder if I > should create a new engine or modify OpenSSL's RSA implementation to > make use of my bigint multiplication. > > > Any hints and suggestions are *very* much appreciated. Thanks.
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). Cheers, Nils -- Nils Larsch [EMAIL PROTECTED] OpenSSL Project http://www.openssl.org/~nils/ ______________________________________________________________________ OpenSSL Project http://www.openssl.org Development Mailing List [email protected] Automated List Manager [EMAIL PROTECTED]
