An Analysis of the Solovay and Strassen Test for Primality
Name
MIT-LCS-TM-108.pdf
Size
2.97 MB
Format
Adobe PDF
Checksum (MD5)
8300756d30e22bc841ef9dd5e140f9d1
Author(s)
Baratz, Alan E.
Date Issued
July 1978
Series/Report no.
MIT-LCS-TM-108
Abstract
In this paper we will analyze the performace of the Solovay and Strasses probabilistic primality testing algorithm. We will show that iterating Solovay and Strassen's algorithm r times using independent random numbers at each iteration, results in a test for the primality of any positive odd integer, n>2, with error probability of 0 (if n is prime), error probability at most 4^-r (if n is composite and non-Carmichael), and error probability at most 2^-r (if n is composite and Carmichael).
Persistent DSpace Link
