Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

Cryptanalysis of GOST R hash function

Zongyue Wang 1 Hongbo yu 2, 3 Xiaoyun Wang 2, 4 
2 CRYPT - Cryptanalyse
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Abstract : GOST R 34.11-2012 is the new Russian hash function standard. 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 2176 and the memory requirement is 2128 bytes. Based on the 9.5-round collision result, a limited birthday distinguisher is presented. More over, a k-collision on 512-bit version of GOST R is constructed which shows the weakness of the structure used in GOST R.
Document type :
Journal articles
Complete list of metadata
Contributor : Phong Q. Nguyen Connect in order to contact the contributor
Submitted on : Wednesday, January 28, 2015 - 8:38:33 AM
Last modification on : Friday, January 21, 2022 - 3:15:36 AM




Zongyue Wang, Hongbo yu, Xiaoyun Wang. Cryptanalysis of GOST R hash function. Information Processing Letters, Elsevier, 2014, 114 (2), pp.8. ⟨10.1016/j.ipl.2014.07.007⟩. ⟨hal-01110356⟩



Record views