Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dietzfelbinger, M. (2004). 5. The Miller-Rabin Test. In: Primality Testing in Polynomial Time. Lecture Notes in Computer Science, vol 3000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25933-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-25933-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40344-9
Online ISBN: 978-3-540-25933-6
eBook Packages: Springer Book Archive