On Wed, Feb 22, 2006, Chris wrote: > On 2/22/06, Chris <[EMAIL PROTECTED]> wrote: > > > > Decryption seg faults without e and is incorrect with e: > > <snip> > > Seems strange to seg fault, doesn't it know something is > > missing/incorrect? Does RSA_new not initialize the structure to a clean > > state? Wouldn't an error be appropriate here? > > > OK, I worked this out. It was the public exponent requirement that was > throwing me off. > > After tracing this I see it's some call to BLINDING_HELPER() (rsa_eay.c line > 466 of ossl 0.9.7i) that needs the public exponent and is causing the seg > fault. AFAIK the rest of the algorithm does not need the public exponent... > Not too big a deal to keep that in there but seems unnecessary. Hmmm. > > Is the public exponent really necessary for decryption? It has been a while > since I looked at the RSA algorithm.
There are security issues associated with RSA private key operations which are handled by OpenSSL trying the reverse operation using a public key which requires the public exponent. While this is particularly the case when all CRT components are present there are some lesser ones when just the private exponent is used. In any case it is a good idea to use or recalculate the CRT components because RSA is much quicker when they are present. Steve. -- Dr Stephen N. Henson. Email, S/MIME and PGP keys: see homepage OpenSSL project core developer and freelance consultant. Funding needed! Details on homepage. Homepage: http://www.drh-consultancy.demon.co.uk ______________________________________________________________________ OpenSSL Project http://www.openssl.org User Support Mailing List openssl-users@openssl.org Automated List Manager [EMAIL PROTECTED]
