How does RSA generate the two prime numbers used for encryption so quickly when its security is based on the difficulty of finding primes?