Abstract
The well-known Miller-Rabin Primality Test MRPT is used to check naturals to be prime or composite. We study the dependence between the length of testing numbers and the number of rounds of MRPT sufficient to give the correct answer and give some recommendations how to choose a suitable set of bases at which MRPT runs more efficiently. Concluding the paper we state a number of theoretical problems which decision allows to improve an implementation of MRPT.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Crandall and C. Pomerance, The prime numbers: a computational perspertive (Springer-Verlag, 2-d. ed., Berlin, 2005).
I. Damgard, P. Landrock, and C. Pomerance, Mathematics of Computation, 61(203), 177 (1993).
S. Ishmukhametov, Methods of factorization of natural numbers (Kazan Federal University, Kazan, 2011) (in russian).
G. Jaeschke, Math. Comput. 61, 915 (1993).
J. Jiang and Y. Deng, Strong pseudoprimes to the first 9 prime bases. arXiv:1207.0063v1 [math.NT], 12 p. (2012).
L. Monier, Theoret. Comput. Sci. 12, 97 (1980).
M. Rabin, Journal of Number Theory 12(1), 128 (1980).
Rene Schoof, Four primality testing algorithms, Algorithmic Number Theory: Lattices, Number Fields, Curves and Cryptography (Cambridge University Press, 2010).
Author information
Authors and Affiliations
Corresponding author
Additional information
Submitted by F. M. Ablayev
Rights and permissions
About this article
Cite this article
Ishmukhametov, S., Mubarakov, B. On practical aspects of the Miller-Rabin Primality Test. Lobachevskii J Math 34, 304–312 (2013). https://doi.org/10.1134/S1995080213040100
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1995080213040100