##plugins.themes.academic_pro.article.sidebar##

Download
pdf
Statistic
Read Counter : 81 Download : 89

##plugins.themes.academic_pro.article.main##

Abstract

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.

Keywords

Miller-Rabin test prime number recursive function deterministic algorithms

##plugins.themes.academic_pro.article.details##

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

How to Cite
Oydin Ahmedova Pulatovna, & Ulugbek Mardiyev Rasulovich. (2023). A method for improving Milner-Rabin algorithm to reduce the number of false witnesses. Texas Journal of Engineering and Technology, 18, 63–70. Retrieved from https://zienjournals.com/index.php/tjet/article/view/3687

References

  1. Горбенко И., Вервейко В. Тестирование чисел на простоту: теория и практика. – 2003.
  2. Nagell, T. (2021). Introduction to number theory (Vol. 163). American Mathematical Soc.
  3. Adleman L. M., Huang M. D. Algorithmic Number Theory First International Symposium, ANTS-I
  4. Ithaca, NY, USA, May 6–9, 1994 Proceedings //Conference proceedings ANTS. – 1994. – С. 292