I'm not using OpenSSL to generate the list of primes. OpenSSl is using
it in the following path:
RSA_generate_key() - in rsa_depr.c
RSA_generate_key_ex() in rsa_gen.c
rsa_builtin_keygen() in rsa_gen.c
BN_generate_prime_ex() in prime.c
BN_is_prime_fasttest_ex() in bn_prime.c
Algorithms of finding new primes are well-known, as is the biggest found
prime. Since I don't remember how big it is, I can't say whether it's
~512-bit or not. However, all the primes up to that one should be known,
shouldn't they? That's what I meant.
Yuliya
-----Original Message-----
What "list" of primes is "known"? Are you using OpenSSL to generate
1024-bit
or larger RSA keys? If so the list of ~512-bit large prime is certainly
not "known".
--
Viktor.
______________________________________________________________________
OpenSSL Project http://www.openssl.org
User Support Mailing List openssl-users@openssl.org
Automated List Manager [EMAIL PROTECTED]
