Hi Adam,
> Could anybody give me any explanation?. What is the
> name of that algorithm? Is it the way to reconstruct exact
> value of P/Q or not?
{d,n} is your private key. Given d, and n, all members can be
recovered (or re-calculated) since you have d, which is the private
exponent. See, for example, PKCS #1, Section 3.2 (RSA Private Key) at
ftp://ftp.rsasecurity.com/pub/pkcs/pkcs-1/pkcs-1v2-1.pdf.
> What about security?
Don't give someone your private exponent, P, or Q.
Jeff
On Fri, Dec 4, 2009 at 5:35 AM, [email protected] <[email protected]> wrote:
> Hi,
>
> I have been a bit surprised, that after initializing
> InvertibleRSAFunction with non-CRT RSA arguments (n,e,d) I have
> obtained private key that looks like CRT. After digging into Initialize
> (const Integer &n, const Integer &e, const Integer &d) function I
> realized, that there are some calculations which reconstructs the rest
> of CRT elements. Could anybody give me any explanation? What is the
> name of that algorithm? Is it the way to reconstruct exact value of P/
> Q or not? What about security?
>
> Thanks in advance!
> --
> Adam Augustyn
>
--
You received this message because you are subscribed to the "Crypto++ Users"
Google Group.
To unsubscribe, send an email to [email protected].
More information about Crypto++ and this group is available at
http://www.cryptopp.com.
