Dear list, did anyone implement a test for a given A an X exists that X ^ k == A (mod N) for a composite N = p*q with q and q being known primes? Any good math paper?
thank you, Vadim ______________________________________________________________________ OpenSSL Project http://www.openssl.org User Support Mailing List [EMAIL PROTECTED] Automated List Manager [EMAIL PROTECTED]
