Cryptanalysis of the GOST Hash Function

Florian Mendel, Norbert Pramstaller, Christian Rechberger, Marcin Kontak, Janusz Szmidt

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review

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.
Original languageEnglish
Title of host publicationAdvances in Cryptology - Proceedings CRYPTO 2008
EditorsDongdai Lin
PublisherSpringer
Pages162-178
ISBN (Print)978-3-540-85173-8
DOIs
Publication statusPublished - 2008
Event28th Annual International Cryptology Conference: CRYPTO 2008 - Santa Barbara, United States
Duration: 17 Aug 200821 Aug 2008

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume5157

Conference

Conference28th Annual International Cryptology Conference
Abbreviated titleCRYPTO 2008
Country/TerritoryUnited States
CitySanta Barbara
Period17/08/0821/08/08

Fingerprint

Dive into the research topics of 'Cryptanalysis of the GOST Hash Function'. Together they form a unique fingerprint.

Cite this