Analysis Of Primality Testing Algorithms And Their Applications In Cryptography
American Journal of Applied Science and Technology · 22.05.2026 · 06 (05) · 166-168
DOI: 10.37547/ajast/volume06issue05-28 ↗Kurz gefasst
Fachartikel in der Zeitschrift American Journal of Applied Science and Technology, online erschienen am 22.05.2026. Verfasst von Mamaraimov Bekzod und 1 weiteren Autor:innen.
Abstract (Originalsprache)
This article analyzes the theoretical foundations, operating principles, and practical efficiency of primality testing algorithms. The role of prime numbers in modern cryptographic systems and the necessity of testing large integers are discussed. The mathematical foundations, advantages, and limitations of the Fermat, Solovay–Strassen, Miller–Rabin, and AKS primality tests are examined. In addition, the computational complexity of probabilistic and deterministic algorithms and their impact on the security of cryptographic systems are evaluated. The research results demonstrate that primality testing algorithms play a crucial role in public-key cryptosystems such as RSA.
Zitieren
APA
Bekzod, M., & Ilkhom, B. (2026). Analysis Of Primality Testing Algorithms And Their Applications In Cryptography. American Journal of Applied Science and Technology, 06(05), 166-168. https://doi.org/10.37547/ajast/volume06issue05-28
Vancouver
Bekzod M, Ilkhom B. Analysis Of Primality Testing Algorithms And Their Applications In Cryptography. American Journal of Applied Science and Technology. 2026;06(05):166-168. doi:10.37547/ajast/volume06issue05-28
BibTeX
@article{Bekzod2026,
author = {Bekzod, Mamaraimov and Ilkhom, Boykuziev},
title = {Analysis Of Primality Testing Algorithms And Their Applications In Cryptography},
journal = {American Journal of Applied Science and Technology},
year = {2026},
volume = {06},
number = {05},
pages = {166--168},
doi = {10.37547/ajast/volume06issue05-28}
}
EUVIMED