Chapter

Advances in Cryptology – CRYPTO 2008

Volume 5157 of the series Lecture Notes in Computer Science pp 162-178

Cryptanalysis of the GOST Hash Function

  • Florian MendelAffiliated withInstitute for Applied Information Processing and Communications (IAIK), Graz University of Technology
  • , Norbert PramstallerAffiliated withInstitute for Applied Information Processing and Communications (IAIK), Graz University of Technology
  • , Christian RechbergerAffiliated withInstitute for Applied Information Processing and Communications (IAIK), Graz University of Technology
  • , Marcin KontakAffiliated withInstitute of Mathematics and Cryptology, Faculty of Cybernetics, Military University of Technology
  • , Janusz SzmidtAffiliated withInstitute of Mathematics and Cryptology, Faculty of Cybernetics, Military University of Technology

Abstract

In this article, we analyze the security of the GOST hash function. The GOST hash function, defined in the Russian standard GOST 34.11-94, is an iterated hash function producing a 256-bit hash value. As opposed to most commonly used hash functions such as MD5 and SHA-1, the GOST hash function defines, in addition to the common iterative structure, a checksum computed over all input message blocks. This checksum is then part of the final hash value computation.

As a result of our security analysis of the GOST hash function, we present the first collision attack with a complexity of about 2105 evaluations of the compression function. Furthermore, we are able to significantly improve upon the results of Mendel et al. with respect to preimage and second preimage attacks. Our improved attacks have a complexity of about 2192 evaluations of the compression function.

Keywords

cryptanalysis hash function collision attack second preimage attack preimage attack