Title
Document Type
Report
Date
6-1992
Keywords
G.3 Probability and Statistics: Probabilistic algorithms (Monte Carlo), Algorithms, Primality testing
Language
English
Disciplines
Computer Sciences
Description/Abstract
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.
Recommended Citation
Hansen, Per Brinch, "Primality Testing" (1992). Electrical Engineering and Computer Science - Technical Reports. 169.
https://surface.syr.edu/eecs_techreports/169
Source
local
Additional Information
School of Computer and Information Science, Syracuse University, SU-CIS-92-13