RSA implementations do use probabilistic primality tests when generating primes. OpenSSL [0] uses the Miller-Rabin primality test for RSA, which can be wrong, b

RSA implementations do use probabilistic primality tests when generating primes. OpenSSL [0] uses the Miller-Rabin primality test for RSA, which can be wrong, but they use enough iterations to make it very unlikely. [0]: https://wiki.openssl.org/index.php/Manual:BN_generate_prime(3)#DESCRIPTION https://wiki.openssl.org/index.php/Manual:BN_generate_prime(...