Hi,
I am trying to add support for a hardware engine which is tied to the
pkcs#11 api. In the ENGINE structure (and the RSA, DSA, DH methods) I
find pointers to functions implementing the modular exponentiation, and
the chinese remainder theorem. Also, the existing engines bring their
own copy of the mod_exp functions, sometimes based on hardware support,
sometimes implemented in terms of BN calls.
As pkcs#11 seems not to support a mod_exp functionality directly, my
questions are:
a) is the existence of the functions a requirement for using ENGINEs?
Not all of them seem to be required, as a comment says "may be null".
(when using the high-level interfaces like rsa_pub_enc(), will
there still be a hidden call to the mod_exp functions?)
b) does the pkcs#11 api offer a "hidden" mod_exp functionality, like
when using the "raw X.509 rsa" mechanism?
c) iff the functions must be present, will the whole speed gain be lost
if I call the software openssl_mod_exp functions?
Sorry for my ignorance -- I am not a mathematician.
Martin
--
<[EMAIL PROTECTED]> | Fujitsu Siemens
Fon: +49-89-636-46021, FAX: +49-89-636-41143 | 81730 Munich, Germany
______________________________________________________________________
OpenSSL Project http://www.openssl.org
Development Mailing List [EMAIL PROTECTED]
Automated List Manager [EMAIL PROTECTED]
