Abstract
In this paper, we deduce asymptotic upper and lower bounds for the average probability of error in the Miller–Rabin primality test.
REFERENCES
Miller G. "Riemann's hypothesis and tests for primality", J. Comput. Syst. Sci. 13, 300-317 (1976).
Rabin M.O. "Probabilistic algorithm for testing primality", J. Number Theor. 12 (1), 128-138 (1980).
Monier L. "Evaluation and comparison of two efficient probabilistic primality testing algorithms", Theor. Comput. Sci. 12 (1), 97-108 (1980).
Ishmukhametov S., Rubtsova R., Savelyev N. "The error probability of the Miller–Rabin primality test", Lobachevskii J. Math. 39 (7), 1010-1015 (2018).
Funding
The work of the first author is conducted in the framework of realization of the development programme of the Volga Region Scientific-Educational Center of Mathematics of Kazan (Volga region) Federal University, agreement no. 075-02-2021-1393.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Sh. T. Ishmukhametov.
Russian Text © The Author(s), 2021, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2021, No. 9, pp. 86–91.
About this article
Cite this article
Mubarakov, B.G. On the Number of Primality Witnesses of Composite Integers. Russ Math. 65, 73–77 (2021). https://doi.org/10.3103/S1066369X21090097
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S1066369X21090097