Miller–Rabin Primality Test
- Mathematics & Logic -
Pure Mathematics Dictionary
Definition
A probabilistic algorithm that tests whether an odd integer n is probably prime by performing one or more strong probable-prime checks to random (or chosen) bases using modular exponentiation and squaring rules.