Skip to Main content Skip to Navigation
Conference papers

Improved Boomerang Attacks on SM3

Dongxia Bai 1 Hongbo Yu 1, 2 Gaoli Wang 3 Xiaoyun Wang 2, 4, 5 
2 CRYPT - Cryptanalyse
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Abstract : The cryptographic hash function SM3 is designed by X. Wang et al. and published by Chinese Commercial Cryptography Administration Office for the use of electronic certification service system in China. It is based on the Merkle-Damgård design and is very similar to SHA-2 but includes some additional strengthening features. In this paper, we apply the boomerang attack to SM3 compression function, and present such distinguishers on up to 34/35/36/37 steps out of 64 steps, with time complexities 231.4, 233.6, 273.4 and 293 compression function calls respectively. Especially, we are able to obtain the examples of the distinguishers on 34-step and 35-step on a PC due to their practical complexities. In addition, incompatible problems in the recent boomerang attack are pointed out.
Document type :
Conference papers
Complete list of metadata
Contributor : Phong Q. Nguyen Connect in order to contact the contributor
Submitted on : Wednesday, December 25, 2013 - 10:14:12 AM
Last modification on : Friday, January 21, 2022 - 3:13:37 AM

Links full text




Dongxia Bai, Hongbo Yu, Gaoli Wang, Xiaoyun Wang. Improved Boomerang Attacks on SM3. ACISP 2013 - 18th Australasian Conference Information Security and Privacy, Jul 2013, Brisbane, Australia. pp.251-266, ⟨10.1007/978-3-642-39059-3_17⟩. ⟨hal-00922228⟩



Record views