Cryptanalysis of the GOST Hash Function

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

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem KonferenzbandBegutachtung


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.
TitelAdvances in Cryptology - Proceedings CRYPTO 2008
Redakteure/-innenDongdai Lin
Herausgeber (Verlag)Springer
ISBN (Print)978-3-540-85173-8
PublikationsstatusVeröffentlicht - 2008
VeranstaltungCrypto 2008: CRYPTO 2008 - Santa Barbara, USA / Vereinigte Staaten
Dauer: 17 Aug. 200821 Aug. 2008


NameLecture Notes in Computer Science
Herausgeber (Verlag)Springer


KonferenzCrypto 2008
KurztitelCRYPTO 2008
Land/GebietUSA / Vereinigte Staaten
OrtSanta Barbara


Untersuchen Sie die Forschungsthemen von „Cryptanalysis of the GOST Hash Function“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren