A method for improving Milner-Rabin algorithm to reduce the number of false witnesses

Authors

  • Oydin Ahmedova Pulatovna Research department of information security and cryptology State Unitary Enterprise Unicon.uz Tashkent, Uzbekistan
  • Ulugbek Mardiyev Rasulovich Cryptology department TUIT named after Muhammad al-Khwarizmi Tashkent, Uzbekistan

Keywords:

Miller-Rabin test, prime number, recursive function, deterministic algorithms

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.

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

2023-03-26

Issue

Section

Articles

How to Cite

A method for improving Milner-Rabin algorithm to reduce the number of false witnesses. (2023). Texas Journal of Engineering and Technology, 18, 63-70. https://mail.zienjournals.com/index.php/tjet/article/view/3687