Institutional Repository
| boomerang and slide-rotational analysis of the sm3 hash function | |
| Kircanski Aleksandar; Shen Yanzhao; Wang Gaoli; Youssef Amr M. | |
| 2013 | |
| Conference Name | 19th International Conference on Selected Areas in Cryptography, SAC 2012 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 304-320 |
| Conference Date | August 15, 2012 - August 16, 2012 |
| Conference Place | Windsor, ON, Canada |
| Indexed Type | EI |
| ISSN | 0302-9743 |
| ISBN | 9783642359989 |
| Department | (1) Concordia Institute for Information Systems Engineering Concordia University Montreal QC Canada; (2) School of Computer Science and Technology Donghua University Shanghai China; (3) State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing China |
| English Abstract | SM3 is a hash function, designed by Xiaoyun Wang et al. and published by the Chinese Commercial Cryptography Administration Office for the use of electronic authentication service system. The design of SM3 builds upon the design of the SHA-2 hash function, but introduces additional strengthening features. In this paper, we present boomerang distinguishers for the SM3 compression function reduced to 32 steps out of 64 steps with complexity 2 14.4, 33 steps with complexity 232.4, 34 steps with complexity 253.1 and 35 steps with complexity 2117.1. Examples of zero-sum quartets for the 32-step and 33-step SM3 compression function are provided. We also point out a slide-rotational property of SM3-XOR, which exists due to the fact that constants used in the steps are not independent. © 2013 Springer-Verlag Berlin Heidelberg.; SM3 is a hash function, designed by Xiaoyun Wang et al. and published by the Chinese Commercial Cryptography Administration Office for the use of electronic authentication service system. The design of SM3 builds upon the design of the SHA-2 hash function, but introduces additional strengthening features. In this paper, we present boomerang distinguishers for the SM3 compression function reduced to 32 steps out of 64 steps with complexity 2 14.4, 33 steps with complexity 232.4, 34 steps with complexity 253.1 and 35 steps with complexity 2117.1. Examples of zero-sum quartets for the 32-step and 33-step SM3 compression function are provided. We also point out a slide-rotational property of SM3-XOR, which exists due to the fact that constants used in the steps are not independent. © 2013 Springer-Verlag Berlin Heidelberg. |
| Keyword | Artificial Intelligence |
| Sponsorship | Department of Electrical and Computer Engineering; Faculty of Engineering; Office of Vice President - Research, University of Windsor |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15908 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Kircanski Aleksandar,Shen Yanzhao,Wang Gaoli,et al. boomerang and slide-rotational analysis of the sm3 hash function[C],2013:304-320. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment