Name
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. © 2013 Springer-Verlag. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-39059-3_17 | ACISP |
Keywords | Field | DocType |
boomerang attack,cryptanalysis,hash function,sm3 | Boomerang attack,Computer science,Computer security,Cryptography,Cryptographic hash function,Service system,Cryptanalysis,Theoretical computer science,Hash function,Certification | Conference |
Volume | Issue | ISSN |
7959 LNCS | null | 16113349 |
Citations | PageRank | References |
2 | 0.42 | 22 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dongxia Bai | 1 | 21 | 3.94 |
| Hongbo Yu | 2 | 1782 | 114.27 |
| Gaoli Wang | 3 | 94 | 12.77 |
| Xiaoyun Wang | 4 | 2338 | 170.86 |