A method for improving Milner-Rabin algorithm to reduce the number of false witnesses
Keywords:
Miller-Rabin test, prime number, recursive function, deterministic algorithmsAbstract
Nowadays, along with the increase in the volume of data, ensuring its protection is one of the important issues. The best way to ensure data confidentiality is the cryptographic method. One of the main parameters of public-key cryptoalgorithms is a prime number. This paper presents an analysis of probabilistic algorithms to check the primality number and improves the Rabin Milner algorithm to reduce the number of false witnesses.
References
Горбенко И., Вервейко В. Тестирование чисел на простоту: теория и практика. – 2003.
Nagell, T. (2021). Introduction to number theory (Vol. 163). American Mathematical Soc.
Adleman L. M., Huang M. D. Algorithmic Number Theory First International Symposium, ANTS-I
Ithaca, NY, USA, May 6–9, 1994 Proceedings //Conference proceedings ANTS. – 1994. – С. 292
Downloads
Published
Issue
Section
License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
User Rights
Under the Creative Commons Attribution-NonCommercial 4.0 International (CC-BY-NC), the author (s) and users are free to share (copy, distribute and transmit the contribution).
Rights of Authors
Authors retain the following rights:
1. Copyright and other proprietary rights relating to the article, such as patent rights,
2. the right to use the substance of the article in future works, including lectures and books,
3. the right to reproduce the article for own purposes, provided the copies are not offered for sale,
4. the right to self-archive the article.