Document Type

Report

Date

6-1992

Embargo Period

5-7-2012

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.

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-92-13

Source

local

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.