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
  • Ulugbek Mardiyev Rasulovich Cryptology department TUIT named after Muhammad al-Khwarizmi Tashkent, Uzbekistan

Keywords:

Miller-Rabin test, prime number, recursive function, deterministic algorithms, probabilistic 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

Downloads

Published

2023-03-24

Issue

Vol. 18 (2023): TJET

Section

Articles

License

Creative Commons 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.

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, 31-38. https://zienjournals.com/index.php/tjet/article/view/3636