An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  • Department of Computer Science
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to an extends the Miller-Rabin test and the Quadratic Frobenius test (QFT) by Grantham. EQFT takes time about equivalent to 2 Miller-Rabin tests, but has much smaller error probability, namely 256/331776t for t iterations of the test in the worst case. We give bounds on the average-case behaviour of the test: consider the algorithm that repeatedly chooses random odd k bit numbers, subjects them to t iterations of our test and outputs the first one found that passes all tests. We obtain numeric upper bounds for the error probability of this algorithm as well as a general closed expression bounding the error. For instance, it is at most 2-143 for k = 500, t = 2. Compared to earlier similar results for the Miller-Rabin test, the results indicates that our test in the average case has the effect of 9 Miller-Rabin tests, while only taking time equivalent to about 2 such tests. We also give bounds for the error in case a prime is sought by incremental search from a random starting point.
Original languageEnglish
Title of host publicationFundamentals of Computation Theory
EditorsAndrzej Lingas, Bengt J. Nilsson
Number of pages14
Publication year2003
ISBN (print)978-3-540-40543-6
Publication statusPublished - 2003
EventInternational Symposium on Fundamentals of Computation Theory - Malmö, Sweden
Duration: 12 Aug 200315 Aug 2003
Conference number: 14


ConferenceInternational Symposium on Fundamentals of Computation Theory
SeriesLecture Notes in Computer Science

    Research areas

  • Worst case method, Error probability, Error estimation, Upper bound, Prime number, Number theory

See relations at Aarhus University Citationformats

ID: 281353