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

dc.contributor.author	Oydin Ahmedova Pulatovna
dc.contributor.author	Ulugbek Mardiyev Rasulovich
dc.date.accessioned	2026-01-01T10:47:04Z
dc.date.issued	2023-03-24
dc.description.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 reducethe number of false witnesses
dc.format	application/pdf
dc.identifier.uri	https://zienjournals.com/index.php/tjet/article/view/3636
dc.identifier.uri	https://asianeducationindex.com/handle/123456789/60773
dc.language.iso	eng
dc.publisher	Zien Journals
dc.relation	https://zienjournals.com/index.php/tjet/article/view/3636/3020
dc.rights	https://creativecommons.org/licenses/by-nc/4.0
dc.source	Texas Journal of Engineering and Technology; Vol. 18 (2023): TJET; 31-38
dc.source	2770-4491
dc.subject	Miller-Rabin test, prime number, recursive function, deterministic algorithms, probabilistic algorithms
dc.title	A method for improving Milner-Rabin algorithm to reduce the number of false witnesses
dc.type	info:eu-repo/semantics/article
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	Peer-reviewed Article

item.page.files

pagination.showing.labelpagination.showing.detail

item.page.filesection.name: pulatovna_2023_a_method_for_improving_milner-rabin_algo.pdf
item.page.filesection.size: 319.55 KB
item.page.filesection.format: Adobe Portable Document Format