MA’LUMOTLARNI SHIFRLASH ALGORITMI AKSLANTIRISHLARINING ALGEBRAIK XUSUSIYATLARI TAHLILI

Ilhom Rahmatullayev; Baxtiyor Abduraximov; Ilhom Boykuziyev; Bakhriddin Kholliyev

Авторы

Ilhom Rahmatullayev Raqamli texnologiyalar va sunʼiy intellektni rivojlantirish ilmiy-tadqiqot instituti
Baxtiyor Abduraximov Muhammad al-Xorazmiy nomidagi Toshkent axborot texnologiylari universiteti
Ilhom Boykuziyev Muhammad al-Xorazmiy nomidagi Toshkent axborot texnologiylari universiteti
Bakhriddin Kholliyev EMU universiteti

Ключевые слова:

Algebraik kriptotahlil, O‘zDSt 1105:2009, Simmetrik blokli shifrlash algoritmi, Chiziqli akslantirishlar, Chiziqsiz akslantirishlar, Algebraik tenglamalar sistemasi, Shifrlash kaliti, Kriptografik xavfsizlik, Algebraik xususiyatlar, Dekompatsiyalash usuli

Аннотация

Mazkur maqolada O‘zDSt 1105:2009 algoritmida ishlatilgan akslantirishlarning algebraik xususiyatlari tahlil qilinadi. Tadqiqotda algebraik kriptotahlil usuli asosida O‘zDSt 1105:2009 algoritmi komponentlarining algebraik tenglamalar orqali ifodalanishi, ularning xususiyatlari va samaradorlik tahlili amalga oshirilgan. Shuningdek, algoritm komponentlari uchun ishlab chiqilgan tenglamalar sistemalari va ularni tahlil qilish usullari ko'rib chiqilgan. Bu usullar orqali algoritmning maxfiy kalitiga oid ma'lumotlarni aniqlash imkoniyati tahlil qilingan. Tadqiqot natijalari algebraik kriptotahlilning samaradorligini oshirishga qaratilgan tavsiyalarni o‘z ichiga oladi.

Библиографические ссылки

Abdel A. K., Amr Y. M. Applications of SAT Solvers to AES key Recovery from Decayed Key Schedule Images // Cryptology ePrint Archive. 2010. Vol. 324.

Alekseychuk A. N. and Kovalchuk L. V.: Towards a Theory of Security Evaluation for GOST-like Ciphers against Differential and Linear Cryptanalysis, Preprint 9 Sep 2011.

Babenko L., Ishchukova E.: Differential analysis of GOST encryption algorithm, In SIN 2010, pp. 149-157, ACM, 2010.

Buchberger B. Grobner-Bases: An Algorithmic Method in Polynomial Ideal Theory. Reidel Publishing Company, Dodrecht - Boston - Lancaster, 1985. Pp. 184-232.

Courtois N. Algebraic Complexity Reduction and Cryptanalysis of GOST. Preprint, 12 November 2011.

Courtois N. and Misztal M. First Differential Attack on Full 32-Round GOST*. in ICICS'11, pp. 216-227, Springer LNCS 7043, 2011.

Courtois N., Gregory V. Bard: Algebraic Cryptanalysis of the Data Encryption Standard. IMA Int. Conf. 2007: 152-169

Courtois N., Klimov A., Patarin J., Shamir A. Efficient algorithms for solving overdefined systems of multivariate polynomial equations // EUROCRYPT, 2000. – P. 392–407.

Courtois N.: Low Complexity Key Recovery Attacks on GOST Block Cipher, In Cryptologia, Volume 37, Issue 1, pp. 1-10, 2013.

Ferguson, N., Schroeppel, R. and Whiting, D. (2001) A Simple Algebraic Representation of Rijndael. Proceedings of Selected Areas in Cryptography, Springer-Verlag, New York, 103-111. http://dx.doi.org/10.1007/3-540-45537-X_8

Fleischmann E., Gorski M., Huhne J., and Lucks S. KR Attack on full GOST Block Cipher with Zero Time and Memory. Published as ISO/IEC JTC 1/SC27 N8229. 2009.

Harris N. Algebraic cryptanalysis of AES: an overview. 2010.

Haruki S. and Toshinobu K.: Differential Cryptanalysis of Reduced Rounds of GOST. In SAC 2000, Selected Areas in Cryptography, Douglas R. Stinson and Stafford E. Tavares, editors, LNCS 2012, pp. 315-323, Springer, 2000.

Jintai Ding, Johannes Buchmann, Mohamed Saied Emam Mohamed, Wael Said Abdelmageed Mohamed, and Ralf-Philipp Weinmann. MutantXL. In Proceedings of the 1st international conference on Symbolic Computation and Cryptography (SCC08), pages 16 – 22, http://www.cdc.informatik.tu–darmstadt.de/reports/reports/MutantXL Algorithm.pdf, Beijing, China, April 2008. LMIB.

Kelsey J., Schneier B. and Wagner D. “Key Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES”, Advances in Cryptology – CRYPTO ’96, volume 1109 of Lecture Notes of Computer Science, Springer-Verlag, 1996, pp. 237-251.

Kleiman E. The XL and XSL attacks on Baby Rijndael // Ms. Thesis. Iowa SU, USA, 2005.