This website does readability filtering of other pages. All styles, scripts, forms and ads are stripped. If you want your website excluded or have other feedback, use this form.

Cryptology ePrint Archive: Report 2013/584 - Cryptanalysis of GOST R Hash Function

Cryptology ePrint Archive: Report 2013/584

Cryptanalysis of GOST R Hash Function

Zongyue Wang, Hongbo Yu, Xiaoyun Wang

Abstract: GOST R is the hash function standard of Russia. This paper presents some cryptanalytic results on GOST R. Using the rebound attack technique, we achieve collision attacks on the reduced round compression function. Result on up to 9.5 rounds is proposed, the time complexity is 2^{176} and the memory requirement is 2^{128} bytes. Based on the 9.5-round collision result, a limited birthday distinguisher is presented. More over, a method to construct k collisions on 512-bit version of GOST R is given which show the weakness of the structure used in GOST R. To the best of our knowledge, these are the first results on GOST R.

Category / Keywords: secret-key cryptography /

Date: received 10 Sep 2013

Contact author: zongyuewang at mail sdu edu cn

Available format(s): PDF | BibTeX Citation

Version: 20130914:025948 (All versions of this report)

Short URL: ia.cr/2013/584


[ Cryptology ePrint archive ]