Miller-Rabin test

is a test of primality, which is an al gorithm determining whether a number is prime. Like the Fermat te st and the Solovay-Strassen test is a test of probability, requir ing the use of random numbers. The original version of this algor ithm (Miller) was designed as a deterministic algorithm, but its accuracy depends on the yet unproven generalized Riemann hypothesis. Michael O. Rabin modified this algorithm to form randomizacyjnej and proved its correctness in this form.