Improved Boomerang Attacks on SM3 - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Improved Boomerang Attacks on SM3

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.

Dates and versions

hal-00922228 , version 1 (25-12-2013)

Identifiers

Cite

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⟩
385 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More