[EMAIL PROTECTED] - Thu Apr 1 13:35:01 2004]: > > Can you give an other link or reference for a description how to > recover one > of the primes if I have (n,e,d) already available? > >
This is a quote from the version on the CryptoAPI mailing list. It was sent originally by John Banes <[EMAIL PROTECTED]>: "1. Multiply the encryption and decryption exponents and subtract 1 -- this gives a multiple of phi(n). 2. Divide this number by 2 and raise several (~10) random values to this exponent [mod N]. 3. If all of the exponentiations in the previous step result in 1, repeat the previous step (dividing again by 2) until some exponentiations produce a result other than 1. 4. Take any result other than 1 or N-1 and take the gcd with N. One of the prime factors of N will pop out." Steve. ______________________________________________________________________ OpenSSL Project http://www.openssl.org Development Mailing List [EMAIL PROTECTED] Automated List Manager [EMAIL PROTECTED]
