## The Miller–Rabin primality test

Cryptosystems like Rivest–Shamir–Adleman (RSA) use large primes to construct public/private key pairs. The security of RSA relies on the fact that, in general, it is computationally expensive to identify the prime factors of a number. But if it is so hard to find prime factors, how can it be easy…