RSA SHIFRLASH ALGORITMI
Abstract
RSA shifrlash algoritmi, 1977 yilda Ron Rivest, Adi Shamir va Leonard Adleman tomonidan yaratilgan, asimmetrik kriptografiya usulidir. U jamoatchilik kaliti (public key) va shaxsiy kaliti (private key) orqali ishlaydi, bu esa ma'lumotlarni xavfsiz shifrlash va deshifrlash imkonini beradi. RSA ning asosiy xususiyati, uning matematik qiyinchiliklari bo'lib, bu faktorlash muammosiga asoslangan. Kalitlar uzunligi xavfsizlik darajasini belgilaydi, hozirgi vaqtda 2048 bit yoki undan yuqori uzunlikdagi kalitlar xavfsiz deb hisoblanadi. RSA keng qo'llanuvchi va ishonchli bir usul hisoblanadi, bu uni elektron imzolar, veb saytlar uchun SSL/TLS sertifikatlari va boshqa ko'plab xavfsizlikka oid dasturlarda keng qo'llanilishini ta'minlaydi. Ushbu maqola RSA algoritmining asoslari, xavfsizlik xususiyatlari, va uning amaliy qo'llanilishlarini chuqurroq tahlil qiladi.
References
1. Rivest, R., Shamir, A., & Adleman, L. (1978). "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems." Communications of the ACM, 21(2), 120-126.
2. Boneh, D., & Shacham, H. (2018). "Twenty Years of Attacks on the RSA Cryptosystem." Notices of the AMS, 45(2), 203-213.
3. Lenstra, A. K., & Verheul, E. R. (2001). "Selecting Cryptographic Key Sizes." Journal of Cryptology, 14(4), 255-293.
4. Bernstein, D. J., Buchmann, J., & Dahmen, E. (2009). Post-Quantum Cryptography. Springer.
5. National Institute of Standards and Technology (NIST) (2020). "Post-Quantum Cryptography Standardization.
6. https://habr.com/ru/articles/745820/
7. Atajonova Saidaxon Borataliyevna Abdullayev Baxtiyor Panji o‘g‘li. Pedagogical conditions for the formation of information and communication Competence of teachers of technical universities. “O‘zbekiston Milliy Universiteti xabarlari (O’zMU)” 2024-yil 1/3/1 - son 81-83-bet
