Algebraic Aspects of the Russian Hash Standard GOST R 34.11-2012

New GOST R 34.11-2012 standard has been recently selected by the Russian government to replace the old one. The algorithm is based on the hash function Stribog introduced in 2010. The high-level structure of the new hash function is similar to GOST R 34.11-94 with minor modifications. However, the compression function was changed significantly. Such a choice of the compression algorithm has been motivated by the Rjndael due to simplicity and understandable algebraic structure. In this paper we consider a number of algebraic aspects of the GOST R 34.11. We show how one can express the cipher in AES-like form over the finite field F28 , and consider some approaches that can be used for the fast software implementation.

[1]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[2]  Joan Daemen,et al.  AES Proposal : Rijndael , 1998 .

[3]  Rudolf Lide,et al.  Finite fields , 1983 .

[4]  Oleksandr Kazymyrov,et al.  Verification of Restricted EA-Equivalence for Vectorial Boolean Functions , 2012, WAIFI.

[5]  Florian Mendel,et al.  Cryptanalysis of the GOST Hash Function , 2008, CRYPTO.