 A cryptographically strong random number generator, which has been properly seeded with adequate entropy, must be used to generate the primes "p" and "q".An analysis comparing millions of public keys gathered from the Internet was carried out in early 2012 by Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung and Christophe Wachter.They were able to factor 0.2% of the keys using only Euclid's algorithm.