Raqamli Transformatsiya va Sun’iy Intellekt
BIR TOMONLAMA FUNKSIYALAR VA ULARNING KRIPTOGRAFIYADA QO‘LLANILISHI
1 Eurasian Multidisciplinary University universiteti.
2 Mirzo Ulug‘bek nomidagi O‘zbekiston Milliy universiteti
3 Muhammad al-Xorazmiy nomidagi Toshkent axborot texnologiyalari universiteti
4 Raqamli texnologiyalar va sunʼiy intellektni rivojlantirish ilmiy-tadqiqot instituti
Abstract
Mazkur maqola bir tomonlama funksiyalar va ularning zamonaviy kriptografiyada qo‘llanilishiga bag‘ishlangan. Unda bir tomonlama funksiyalarning matematik asoslari, xususiyatlari, turlari va ularning axborot xavfsizligini ta’minlashdagi roli yoritilgan. Ayniqsa, shifrlash algoritmlari, xesh funksiyalari, raqamli imzo, parollarni himoyalash kabi sohalarda ushbu funksiyalarning qo‘llanilishi batafsil tahlil qilingan. Maqolada bir tomonlama funksiyalarni amaliyotda qo‘llashning afzalliklari va cheklovlari, shuningdek, ular bilan bog‘liq xavflar ham ko‘rib chiqilgan. Tadqiqot natijalari bir tomonlama funksiyalarning zamonaviy axborot xavfsizligi tizimlarida ahamiyatini tushunishga yordam beradi.
References
- Håstad, J., Impagliazzo, R., Levin, L. A., & Luby, M. (1999). Hard-Core Predicates for Any One-Way Function. Journal of the ACM, 46(5), 735–782.
- Lamport, L. (1979). Constructing Digital Signatures from a One-Way Function. Communications of the ACM, 22(11), 652-656. Retrieved from https://dl.acm.org/doi/10.1145/359168.359194
- Bellare, M., Desai, A., Jokipii, E., & Rogaway, P. (1997). A Concrete Security Treatment of Symmetric Encryption. Journal of Computer and System Sciences, 59(3), 523-573. Retrieved from https://dl.acm.org/doi/10.1145/256533.256559
- Bellare, M., & Rogaway, P. (1993). Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. Proceedings of the 1st ACM Conference on Computer and Communications Security, 1-12. Retrieved from https://eprint.iacr.org/2005/022.pdf
- Håstad, J., Impagliazzo, R., Levin, L. A., & Luby, M. (1999). One-Way Functions and Pseudorandom Generators. Journal of the ACM, 46(5), 735–782.
- Diffie, W., & Hellman, M. E. (1976). New Directions in Cryptography. IEEE Transactions on Information Theory, 22(6), 644–654.
- Rivest, R. L., Shamir, A., & Adleman, L. (1978). A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM, 21(2), 120–126.
- Levin, L. A. (1986). On the Theory of Average Case Complexity. Journal of Computer and System Sciences, 33(1), 123–138.
- Yao, A. C. (1982). On the Existence of Pseudorandom Generators. ACM Transactions on Computational Theory, 4(1), 1-17. Retrieved from https://dl.acm.org/doi/10.1145/800130.803402
- Bellare, M., & Rogaway, P. (2005). Towards Evaluating the Security of One-Way Function Implementations. Retrieved from https://eprint.iacr.org/2005/022.pdf