G.3 Probability and Statistics: Probabilistic algorithms (Monte Carlo), Algorithms, Primality testing
This tutorial describes the Miller-Rabin method for testing the primality of large integers. The method is illustrated by a Pascal algorithm. The performance of the algorithm was measured on a Computing Surface.
Hansen, Per Brinch, "Primality Testing" (1992). Electrical Engineering and Computer Science Technical Reports. Paper 169.