Proportion of primes generated by strong prime methods

The numbers of primes generated by two prime generation methods are evaluated. The methods considered generate strong primes for cryptographic use in the RSA public-key cryptosystem. The results show that they generate sufficient primes to resist cryptanalytic attack by prime enumeration for the sizes of primes used to guard against factorisation attack.