79221bc265
verification step of CRT private key operations in the RSA code - previously no montgomery form was checked or used for 'n', and so it would be generated on the fly each time. As a result, private key operations are now a percent or two faster. Rather than adding this as another repetition of the nearly-identical montgomery "check for first-use" initialisation code blocks, I've taken this chance to create a helper function and macro-wrapper to replace them. PR: 475 |
||
---|---|---|
.. | ||
.cvsignore | ||
Makefile.ssl | ||
rsa.h | ||
rsa_asn1.c | ||
rsa_chk.c | ||
rsa_depr.c | ||
rsa_eay.c | ||
rsa_err.c | ||
rsa_gen.c | ||
rsa_lib.c | ||
rsa_none.c | ||
rsa_null.c | ||
rsa_oaep.c | ||
rsa_pk1.c | ||
rsa_saos.c | ||
rsa_sign.c | ||
rsa_ssl.c | ||
rsa_test.c |