Variations on a Miller–Rabin Theme

Abstract

The Miller–Rabin test is a useful probabilistic method for finding large primes. In this paper, we explain the method in detail and give three variations on this test. These variations were originally developed as student projects to supplement a course in error correcting codes and cryptography.

Keywords:

• Miller–Rabin test
• prime number
• cryptography
• RSA
• finite fields

DISCLOSURE STATEMENT

No potential conflict of interest was reported by the author(s).

Additional information

Notes on contributors

Jeffrey Ehme

Jeffrey Ehme obtained his PhD in mathematics from Auburn University and is a professor of mathematics at Spelman College where he has taught for 30 years. He is particularly interested in theoretical mathematics that have practical applications.