On Sun, Jun 07, 2009, jaze lee wrote: > That is , n = q*p , we can choose the prime has given bits, but we > can not know all that prime in that range.if > we want to know the range , we should test it every odd number in that > range, or should find a function that can do the job efficiently . > The problem is we can not find the function yet ? or some other ways > to judge a big integer whether it's a prime. Is it so-called > mathematics problem that many cipher based on it ? >
Even if we did know all primes in the given range there are too many to simply try each one to see if it divides n. Steve. -- Dr Stephen N. Henson. Email, S/MIME and PGP keys: see homepage OpenSSL project core developer and freelance consultant. Homepage: http://www.drh-consultancy.demon.co.uk ______________________________________________________________________ OpenSSL Project http://www.openssl.org User Support Mailing List openssl-users@openssl.org Automated List Manager majord...@openssl.org
