NSA (New Stream Algorithm) simmetrik oqimli shifrlash algoritmini kriptotahlil usullariga baholash mezonlari
Боковая панель статьи
Основное содержимое статьи
Аннотация
Mazkur maqolada, NSA (New Stream Algorithm) deb nomlangan yangi oqimli shifrlash algoritmi taklif etilgan. Ushbu algoritm 128-bit maxfiy kalit va 128-bit boshlang‘ich vektorlardan foydalanadi va har bir raundda 64-bit chiqish qiymati hosil qiladi. Algoritmning me’moriy va dasturiy amaliyotlar uchun mosligi, qayta sinxronizatsiya hujumi, bog‘langan kalit hujumi va chiqish ketma-ketligining linear korrelyatsiyasi asosida o‘tkazilgan hujum usullariga qarshi xavfsizligi baholanadi. NSA algoritmining tegishli kalit asosidagi hujumlarga va qayta sinxronizatsiya hujumlariga, shuningdek, differentsial va linear kriptotahlil kabi an’anaviy usullarga qarshi qanchalik bardoshli ekanligi batafsil tahlil qilinadi. Tahlil natijalari NSA algoritmi xavfsiz oqimli shifrlash algoritmi ekanligini tasdiqlaydi. Shu bilan birga, algoritmining turli xavf-xatarlarga qarshi turish qobiliyati, jumladan, an’anaviy va zamonaviy tahdidlarga qarshilik ko‘rsatishi muhokama qilinadi. Tahlillar mazkur algoritmni xavfsiz oqimli shifrlash algoritmi ekanligini tasdiqlaydi.
Информация о статье
Это произведение доступно по лицензии Creative Commons «Attribution» («Атрибуция») 4.0 Всемирная.
Библиографические ссылки
J. Daemen, “Cipher and hash function design strategies based on linear and differential cryptanalysis,” Doctoral Dissertation, March 1995, K. U. Leuven
Rakhmatullaevich R. I., Mardano-kulovich I. B. Analysis of cryptanalysis methods applied to stream encryption algorithms //Artificial Intelligence, Blockchain, Computing and Security Volume 1. – CRC Press, 2024. – С. 393-401.
Rahmatullayev I. R. Oqimli shifrlash algoritmlari va ularni vujudga kelish sabablari //International Journal of Theoretical and Applied Issues of Digital Technologies. – 2022. – Т. 2. – №. 2. – С. 119-128.
Raxmatullayebich R. I. Stream encryption algorithms and the basis of their creation //central asian journal of mathematical theory and computer sciences. – 2022. – т. 3. – №. 12. – с. 165-173.
Rahmatullayev I. A new key stream encryption algorithm and its cryptanalysis: The new stream encryption algorithm (NSA-New Stream Algorithm) is proposed in this work. The input parameters are considered a 128-bit secret key and 128-bit initialization vectors in the new algorithm. A 64-bit line is generated in each round as the output value. The architecture of the algorithm is particularly suitable for efficient hardware implementations, together with this, this algorithm is also suitable for software implementation ... //Scientific and Technical Journal of Namangan Institute of Engineering and Technology. – 2023. – Т. 8. – №. 1. – С. 146-157.
Rakhmatullaev I. Self-synchronizing (asynchronous) Stream Encryption Algorithms //Scientific Collection «InterConf». – 2023. – №. 164. – С. 249-254.
S. Fluhrer, M. Shamir, “Weaknesses in the Key Scheduling Algorithm of RC4,” Selected in Areas in Cryptography, SAC 2001, Springer-Verlag, LNCS 2259, pp. 1– 24, 2001.
A. Clark, J. Golic, W. Millan, L. Penna, L. Simpson, “The LILI-128 Keystream Generator,” NESSIE project submission, 2000, http://www.cryptonessie.org
S. Fluhrer, “Cryptanalysis of the SEAL 3.0 Pseudorandom Function Family,” Fast Software Encryption, FSE 2001, Proceedings, pp. 142–151, 2001.
Khudoykulov Z. T., Rakhmatullaev I. R., Umurzakov O. S. H. NSA algoritmining akslantirishlari tanlanishining xavfsizlik talablarini bajarilishidagi o ‘rni //International Journal of Theoretical and Applied Issues of Digital Technologies. – 2023. – Т. 6. – №. 4. – С. 97-101.
P. Rogaway, D. Coppersmith, “A Software-Optimized Encryption Algorithm,” Journal fo Cryptography, Vol. 11, No. 4, pp. 273–287, 1998.
Rahmatullayev I.R. Algebraik kriptotahlil usuli va uning oqimli shifrlash algoritmlariga qoʻllanish asoslari: Algebraic Cryptanalysis Method and Basics of its Application to Stream Encryption Algorithm //International Journal of Theoretical and Applied Issues of Digital Technologies. – 2023. – Т. 4. – №. 2. – С. 96-102.