Raqamli Transformatsiya va Sun’iy Intellekt
OQIMLI SHIFRLARNING MATEMATIK MODELI VA XAVFSIZLIK MEZONLARI
1 Toshkent Kimyo xalqaro universiteti Samarqand filiali
Zenodo DOI: 10.5281/zenodo.23832269
Keywords
Abstract
Oqimli shifrning statistik jihatdan tasodifiyga o‘xshash chiqishi uning kriptografik xavfsizligini o‘z-o‘zidan ta’minlamaydi. Mazkur maqolada ushbu farq chekli holat modeli, Boolean mezonlar, chiziqli murakkablik, holatning kuzatiluvchanligi va protokol shartlarini birlashtiruvchi qayta tekshiriladigan audit orqali miqdoriy asoslanadi. Tadqiqotda chiziqli LFSR16 hamda kvadratik filtrli QF16 nazorat generatorlari to‘liq holatlar fazosida tekshirildi; ChaCha20 esa amaliy taqqoslash obyekti sifatida olindi.
Har bir generator uchun 16 384 bitdan iborat 256 ta chiqish oynasi, jami 12 582 912 bit tahlil qilindi. QF16 ning nochiziqligi 32 512, bir bitli empirik entropiyasining o‘rtachasi 0,999972 bo‘lishiga qaramay, uning chiziqli murakkabligi atigi 136 ga tengligi va keyingi 512 bitni xatosiz bashorat qilish mumkinligi aniqlandi. Uchta tanlangan statistik sinovga Holm tuzatishi qo‘llanganda QF16 hamda ChaCha20 uchun bir xil — 255/256 — rad etilmagan oynalar soni olindi. Barcha 65 535 boshlang‘ich holatni sanash QF16 holatini bir qiymatli aniqlash uchun zarur va yetarli kuzatuv uzunligi 29 bit ekanini ko‘rsatdi; 28 bitda qoladigan yagona noaniq juftlik ham topildi. Nonce takrorlanishi va shifrmatnni o‘zgartirish tajribalari maxfiylik hamda yaxlitlik talablari alohida tekshirilishi lozimligini tasdiqladi. Natijalar statistik ko‘rsatkichlarni xavfsizlik darajasi sifatida talqin qilish o‘rniga, dalil turi va amal qilish chegarasi ko‘rsatilgan ko‘p bosqichli baholashdan foydalanish zarurligini asoslaydi.
References
- Xudoyqulov, Z. T., Rahmatullayev, I. R. Mavjud oqimli shifrlash algoritmlarining qiyosiy tahlili. Al-Farg‘oniy avlodlari, 1(1), 129–134 (2024).
- Nir, Y., Langley, A. ChaCha20 and Poly1305 for IETF Protocols. RFC 8439 (2018). DOI: 10.17487/RFC8439.
- Massey, J. L. Shift-register synthesis and BCH decoding. IEEE Transactions on Information Theory, 15(1), 122–127 (1969). DOI: 10.1109/TIT.1969.1054260.
- Carlet, C. Boolean Functions for Cryptography and Error-Correcting Codes. In: Crama, Y., Hammer, P. L. (eds.), Boolean Models and Methods in Mathematics, Computer Science, and Engineering, 257–397. Cambridge University Press (2010). DOI: 10.1017/CBO9780511780448.011.
- Rahmatullayev, I. NewHSA oqimli shifrlash algoritmining xususiyatlari. Al-Farg‘oniy avlodlari, 1(2), 100–105 (2025). DOI: 10.5281/zenodo.15580990.
- Turan, M. S., McKay, K., Kang, J., Kelsey, J., Chang, D. Ascon-Based Lightweight Cryptography Standards for Constrained Devices: Authenticated Encryption, Hash, and Extendable Output Functions. NIST SP 800-232 (2025). DOI: 10.6028/NIST.SP.800-232.
- Rahmatullayev, I. R. Oqimli shifrlash algoritmlari va ularni vujudga kelish sabablari. International Journal of Theoretical and Applied Issues of Digital Technologies, 2(2), 119–128 (2022).
- Zhang, M., Sun, Y. A New Practical Cube Attack via Recovering Numerous Superpolys. IACR Transactions on Symmetric Cryptology, 2024(4), 38–63 (2024). DOI: 10.46586/tosc.v2024.i4.38-63.
- Holm, S. A Simple Sequentially Rejective Multiple Test Procedure. Scandinavian Journal of Statistics, 6(2), 65–70 (1979). JSTOR: 4615733.
- Courtois, N. T. Fast Algebraic Attacks on Stream Ciphers with Linear Feedback. CRYPTO 2003, LNCS 2729, 176–194. Springer (2003). DOI: 10.1007/978-3-540-45146-4_11.
- De Cannière, C., Preneel, B. Trivium. In: New Stream Cipher Designs, LNCS 4986, 244–266. Springer (2008). DOI: 10.1007/978-3-540-68351-3_18.
- Rogaway, P. Nonce-Based Symmetric Encryption. Fast Software Encryption — FSE 2004, LNCS 3017, 348–358. Springer (2004). DOI: 10.1007/978-3-540-25937-4_22.
- Rahmatullayev, I. R., Boyquziyev, I. M., Omonov, A. A. Oqimli shifrlash uchun dasturiy yechimlar. Digital Transformation and Artificial Intelligence, 2(4), 28–38 (2024).
- Rueppel, R. A. Analysis and Design of Stream Ciphers. Springer, Berlin, Heidelberg (1986). DOI: 10.1007/978-3-642-82865-2.
- Rukhin, A. et al. A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. NIST SP 800-22 Rev. 1a (2010). DOI: 10.6028/NIST.SP.800-22r1a.
- Courtois, N. T., Meier, W. Algebraic Attacks on Stream Ciphers with Linear Feedback. EUROCRYPT 2003, LNCS 2656, 345–359. Springer (2003). DOI: 10.1007/3-540-39200-9_21.
- Rakhmatullaev, I., Abdurakhimov, B. New approaches to assessing the resilience of the A5/1 stream cipher algorithm. International Journal of Theoretical and Applied Issues of Digital Technologies, 8(1), 122–128 (2025). DOI: 10.62132/ijdt.v8i1.240.
- NIST. Decision to Revise NIST SP 800-22 Rev. 1a. CSRC, 19 April 2022. Rasmiy xabar; murojaat sanasi: 11.10.2026. [CSRC]
- Rahmatullayev, I. R. Oqimli shifrlash algoritmlari bardoshliligini differensial va algebraik kriptotahlil usullari yordamida baholash. Digital Transformation and Artificial Intelligence, 2(1), 64–70 (2024).
- Khudoykulov, Z. T., Rakhmatullayev, I. R. A new key stream encryption algorithm and its cryptanalysis. Scientific and Technical Journal of Namangan Institute of Engineering and Technology, 8(1), 146–157 (2023).
- Shannon, C. E. Communication Theory of Secrecy Systems. Bell System Technical Journal, 28(4), 656–715 (1949). DOI: 10.1002/j.1538-7305.1949.tb00928.x.
- Siegenthaler, T. Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Transactions on Information Theory, 30(5), 776–780 (1984). DOI: 10.1109/TIT.1984.1056949.
- Dinur, I., Shamir, A. Cube Attacks on Tweakable Black Box Polynomials. EUROCRYPT 2009, LNCS 5479, 278–299. Springer (2009). DOI: 10.1007/978-3-642-01001-9_16.