Miller-Rabin test

mathematics

Written by

The Information Architects of Encyclopaedia Britannica

Last updated

July 19, 2026

Quick Summary

The Miller-Rabin test is an algorithm used in mathematics and computer science to determine if a given number is a prime number. It was co-developed by Michael Oser Rabin.1

This test is a probabilistic primality test, meaning it can determine with a high degree of certainty whether a number is prime, but it does not offer absolute proof. It is an improvement upon earlier methods like Fermat's Little Theorem, which can be fooled by composite numbers known as pseudoprimes. The Miller-Rabin test is more reliable and is widely used in cryptography and data encryption due to its efficiency and accuracy.21

Summary created from Britannica articles using AI. AI can make mistakes, so verify using Britannica articles.

2 Britannica Sources

Ask Britannica AI about this topic

Britannica doesn't have a full article on this topic, so we've curated a list of our relevant coverage.

Michael Oser Rabin
… in mathematics, Rabin codeveloped the Miller-Rabin test, an algorithm for determining if a given number is a prime number. This was just one aspect of Rabin’s numerous contributions to the fields of cryptography and data encryption. Perhaps his most far-reaching work was his invention, with the Israeli American computer scientist…
Read More
… in mathematics, Rabin codeveloped the Miller-Rabin test, an algorithm for determining if a given number is a prime number. This was just one aspect of Rabin’s numerous contributions to the fields of cryptography and data encryption. Perhaps his most far-reaching work was his invention, with the Israeli American computer scientist…
Read More