Article

Article title ALGORITHMS OF RESISTANCE EVALUATION CIPHERS BY ALGEBRAIC CRYPTANALYSIS METHOD
Authors L.K. Babenko, E.A. Maro
Section SECTION IV. METHODS AND MEANS OF CRYPTOGRAPHY AND STEGANOGRAPHY
Month, Year 02, 2014 @en
Index UDC 681.03.245
DOI
Abstract The research of algebraic cryptanalysis method was carried out in this work, we specified basic stages of resistance analysis for block encryption algorithms. Systems of the equations for tables of various sizes of nonlinear transformations of substitution for simplified model of GOST 28147-89 algorithm are received, also we solve a one of this systems by a XL method. During this work we produced a program, which has realised a generation and solving of system of equations describing nonlinear transformations of substitution. We analysed a nonlinear systems of equations and calculated a value of complexity of XL method for eight blocks of substitution. We presented algorithm for finding substitution blocks of GOST 28147-89. It has required at most 232 operations encoding for encryption algorithm GOST 28147-89. The authors consider the possibility of increasing the effectiveness of existing methods of cryptanalysis applied to the Russian standard GOST 28147-89. We found plain texts for fixed keys, which reduce the actual encryption of up to 16 rounds instead of 32.

Download PDF

Keywords Algebraic cryptanalysis; XL method; nonlinear transformations of substitution; linearization nonlinear systems; Gauss elimination method; a cryptographic key; GOST28147-89 encryp- tion algorithm.
References 1. ГОСТ 28147-89. Системы обработки информации. Защита криптографическая. Алгоритм криптографического преобразования. – М.: Изд-во стандартов, 1989. – 28 с.
2. Панасенко С.П. Стандарт шифрования ГОСТ 28147-89. Обзор криптоаналитических исследований. // http://www.cio-world.ru/.
3. Courtois N. Security Evaluation of GOST 28147-89 In View Of International Standardisation // http://eprint.iacr.org/2011/211.
4. Kleiman E., The XL and XSL attacks on Baby Rijndael. // http://orion.math.iastate.edu/dept/ thesisarchive/MS/EKleimanMSSS05.pdf.
5. Courtois N. How Fast can be Algebraic Attacks on Block Ciphers./ Nicolas T. Courtois // Cryptology ePrint Archive, Report 2006/168, 2006.
6. Courtois N., Klimov A., Patarin J., Shamir A. Efficient algorithms for solving overdefined systems of multivariate polynomial equations // EUROCRYPT, 2000. – P. 392–407.
7. Saarinen M.-J. A chosen key attack against the secret S-boxes of GOST //
http://citeseer.ist.psu.edu – August 12, 1998.
8. Бабенко Л.К., Маро Е.А. Вычисление блоков замены алгоритма шифрования ГОСТ 28147-89 // Труды конгресса по интеллектуальным системам и информационным технологиям «IS&IT’11». Научное издание в 4-х томах. Т. 3. – М.: Физматлит, 2011.– C. 393-395.
9. Babenko L.K., Ishchukova E.A., Maro E.A. Research about Strength of GOST 28147-89 Encryption Algorithm // Proceedings of the 5th international conference on Security of information and networks (SIN 2012), ACM, New York, NY, USA. – P. 80-84.

Comments are closed.