News for hackers. Stuff that matters.
Re:GIMPS Project Discovers Largest Known Prime Number by deckar01 on Wednesday January 03, 2018 @05:09PM (#16065743)
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(...

There are no comments on this comment yet.