Thanks much for the clarification. I'm interested in re-implementing RSA for my own education; can someone point me to the location in the openssl sources where the RSA keys are actually generated (so I can see how the BIGNUMs are manipulated)?
Thanks, Mike On Thu, Dec 23, 2010 at 1:17 PM, Mounir IDRASSI <mounir.idra...@idrix.net> wrote: > Take a look at : > http://en.wikipedia.org/wiki/RSA#Using_the_Chinese_remainder_algorithm > > exponent1 = dp > exponent2 = dq > coefficient = qInv > > -- > Mounir IDRASSI > IDRIX > http://www.idrix.fr > > On 12/23/2010 9:48 PM, Mike Mohr wrote: >> >> Good afternoon, >> >> When generating an RSA key, several components are described in the >> output file. Per the RSA specification on wikipedia, I can identify >> the following values: >> >> prime1: p >> prime2: q >> modulus: N = p * q >> publicExponent: e >> privateExponent: d >> >> What I'm not clear about is what function these values play: >> >> exponent1: ?? >> exponent2: ?? >> coefficient: ?? >> >> Can someone explain? >> >> Thanks, >> Mike >> ______________________________________________________________________ >> OpenSSL Project http://www.openssl.org >> User Support Mailing List openssl-us...@openssl.org >> Automated List Manager majord...@openssl.org > > ______________________________________________________________________ > OpenSSL Project http://www.openssl.org > User Support Mailing List openssl-us...@openssl.org > Automated List Manager majord...@openssl.org > ______________________________________________________________________ OpenSSL Project http://www.openssl.org User Support Mailing List openssl-users@openssl.org Automated List Manager majord...@openssl.org
