Hi! Is the sentence "It checks that p and q are in fact prime, and that n = p*q" in RSA_check_key's documentation mean that it checks for weak primes, like the ones mentioned here?: http://arstechnica.com/business/news/2012/02/crypto-shocker-four-of-every-1000-public-keys-provide-no-security.ars
As I understand there are two cases. One is when the prime is not exactly prime. I would expect RSA_check_key to find this out, but what is the extent of the check? The other cause is a clash with already existing prime factors out there. I guess that checking for this would involve looking up a list of prime factors collected on the net. Is there such tool accessible to mere mortals?
