Sorry for the delay, this ticket slipped through the net, and Nils Larsch recently brought it to my attention.
Vadim Fedukovich wrote: [snip] > I'm particular interested exactly why it is believed that > gcd(p-1,e)==1 and gcd(q-1,e)==1 (according to comments > in the source). [snip] The gcd() check is redundant because p and q are already generated such that gcd([p|q]-1,e) is 1. As 'e' is prime, this amounts to stating "([p|q]-1) not divisible by 'e'". As neither is divisible by e, neither will (p-1)(q-1) be. Thanks for keeping an eye open, I'm cleaning out the commented code and the misleading commentry. -- Geoff Thorpe, RT/openssl.org ______________________________________________________________________ OpenSSL Project http://www.openssl.org Development Mailing List [EMAIL PROTECTED] Automated List Manager [EMAIL PROTECTED]
