Boomerang and slide-rotational analysis of the SM3 hash function

  • Aleksandar Kircanski
  • , Yanzhao Shen
  • , Gaoli Wang*
  • , Amr M. Youssef
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations

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.

Original languageEnglish
Title of host publicationSelected Areas in Cryptography - 19th International Conference, SAC 2012, Revised Selected Papers
Pages304-320
Number of pages17
DOIs
StatePublished - 2013
Externally publishedYes
Event19th International Conference on Selected Areas in Cryptography, SAC 2012 - Windsor, ON, Canada
Duration: 15 Aug 201216 Aug 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7707 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference19th International Conference on Selected Areas in Cryptography, SAC 2012
Country/TerritoryCanada
CityWindsor, ON
Period15/08/1216/08/12

Keywords

  • Boomerang attack
  • Cryptanalysis
  • Rotational attack
  • SM3
  • Slide attack

Fingerprint

Dive into the research topics of 'Boomerang and slide-rotational analysis of the SM3 hash function'. Together they form a unique fingerprint.

Cite this