Application of the algebraic cryptanalysis method to the Kuznyechik encryption algorithm
Аннотация
This paper examines the application of the algebraic cryptanalysis method to the Kuznyechik encryption algorithm. The algebraic properties of reflections are studied, algorithms for the formation of a system of relative algebraic equations the formation of equations representing rounds are developed. When expressed using the proposed methods, it was found that the number of unknowns in the system of equations representing the 8-round Kuznyechik encryption algorithm is ≈2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">55</sup> , and the required memory size is ≃ 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">62</sup> .