5. The Miller-Rabin Test

  • Martin Dietzfelbinger
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3000)


In this chapter, we describe and analyze our first randomized primality test, which admits extremely efficient implementations and a reasonable worst-case error probability of \(\frac{1}{4}\). The error analysis employs simple group theory and the Chinese Remainder Theorem.


Error Probability Prime Number Arithmetic Operation Proper Subgroup Primality Test 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Martin Dietzfelbinger

    There are no affiliations available

    Personalised recommendations