Dr S N Henson <[EMAIL PROTECTED]> writes:
> > RSA_eay_mod_exp (I assume that's the actual implementation of
> > rsa_mod_exp) doesn't check for computation errors (due to MPI library
> > bugs or random bit flipping). It probably should, because there's a
> > simple attack which recovers the priva
Florian Weimer wrote:
>
> Dr S N Henson <[EMAIL PROTECTED]> writes:
>
> > If the other components are present then a more efficient version of the
> > algorithm can be used (typically twice as fast) using rsa_mod_exp. This
> > is the Chinese remainder theorem (CRT) version.
>
> RSA_eay_mod_exp
Dr S N Henson <[EMAIL PROTECTED]> writes:
> If the other components are present then a more efficient version of the
> algorithm can be used (typically twice as fast) using rsa_mod_exp. This
> is the Chinese remainder theorem (CRT) version.
RSA_eay_mod_exp (I assume that's the actual implementat
Hey there,
I know the original poster already has his code working, but well ... I had
already begun this reply so I'll just press on anyway! This may be of use to
others now (or in the future) if they're trying to implement custom RSA_METHODs
and/or ENGINEs.
On Sun, 25 Mar 2001, Dr S N Henson w
"Kenneth R. Robinette" wrote:
>
>
> One minor suggestion, it would appear to me that the app_data field
> in the RSA_METHOD structure perhaps should be a void * instead
> of a char *. If I understand everything correctly, I should be able to
> place a pointer to a private structure in this fie
Date sent: Sun, 25 Mar 2001 14:04:58 +0100
From: Dr S N Henson <[EMAIL PROTECTED]>
Organization: S N Henson
To: [EMAIL PROTECTED]
Subject: Re: RSA Private Encrypt
Send reply to: [EMAIL PROTECTED]
Dr.
"Kenneth R. Robinette" wrote:
>
>
> I was hoping that this was the case. Now if I set the
> RSA_FLAG_EXT_PKEY flag, how do I specify the function that will
> be called by OpenSSL to do the private encrypt? Is this available to
> a client program? I tried following the logic but quite frankly
