On Thu, Jan 10, 2013 at 9:01 AM, Tayade, Nilesh <nilesh.tay...@netscout.com> wrote: >> -----Original Message----- >> From: owner-openssl-us...@openssl.org [mailto:owner-openssl- >> us...@openssl.org] On Behalf Of Jakob Bohm >> Sent: Thursday, January 10, 2013 6:56 PM >> To: openssl-users@openssl.org >> Subject: Re: RSA_private_decrypt function takes longer time. > [...] > >> > Coming back to this. I dumped the PEM key in text format, and it >> shows n, d, dQ, dP, qInv, p and q. >> > Does that mean my private key is not just a 'd-only' key? >> >> That means you have a key with all the extra numbers for "Chinese >> Remaineder Theorem" based speedups. (n, e) is your public key. >> (n, d) is your "d-only-cannot-get-the rest" private key. (n, d, e) >> is your "d-only-can-figure-out-the-rest" private key. (n, d or e, p or >> q) is your "enough-to-figure-out-the-rest" private key. (n, d, dQ, dP, >> qIn, p, q) is your "all-the-details-already-there" private key. >> >> So this is good, if you have a safe place to store all those numbers. > Appreciate the explanation. Thanks. > So I feel like I should try some hardware for asymmetric decryption, in order > to push the performance. Performance is overrated. Before anything, the program has to be correct. It should be secure. And it can be efficient.
If it does not need to be correct, I can make it as fast as you'd like. We'll start by only allowing eNull and aNull :) Jeff ______________________________________________________________________ OpenSSL Project http://www.openssl.org User Support Mailing List openssl-users@openssl.org Automated List Manager majord...@openssl.org
