MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Computer Science and Artificial Intelligence Lab (CSAIL)
  • LCS Publications
  • LCS Technical Memos (1974 - 2003)
  • View Item
  • DSpace@MIT Home
  • Computer Science and Artificial Intelligence Lab (CSAIL)
  • LCS Publications
  • LCS Technical Memos (1974 - 2003)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

An Analysis of the Solovay and Strassen Test for Primality

Author(s)
Baratz, Alan E.
Thumbnail
DownloadMIT-LCS-TM-108.pdf (2.971Mb)
Metadata
Show full item record
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).
Date issued
1978-07
URI
https://hdl.handle.net/1721.1/148936
Series/Report no.
MIT-LCS-TM-108

Collections
  • LCS Technical Memos (1974 - 2003)

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.