Linearity within the SMS4 block cipher

  • Authors:
  • Muhammad Reza Z'aba;Leonie Simpson;Ed Dawson;Kenneth Wong

  • Affiliations:
  • Information Security Institute, Queensland University of Technology, Brisbane, Queensland, Australia;Information Security Institute, Queensland University of Technology, Brisbane, Queensland, Australia;Information Security Institute, Queensland University of Technology, Brisbane, Queensland, Australia;Information Security Institute, Queensland University of Technology, Brisbane, Queensland, Australia

  • Venue:
  • Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present several new observations on the SMS4 block cipher, and discuss their cryptographic significance. The crucial observation is the existence of fixed points and also of simple linear relationships between the bits of the input and output words for each component of the round functions for some input words. This implies that the nonlinear function T of SMS4 does not appear random and that the linear transformation provides poor diffusion. Furthermore, the branch number of the linear transformation in the key scheduling algorithm is shown to be less than optimal. The main security implication of these observations is that the round function is not always non-linear. Due to this linearity, it is possible to reduce the number of effective rounds of SMS4 by four. We also investigate the susceptibility of SMS4 to further cryptanalysis. Finally, we demonstrate a successful differential attack on a slightly modified variant of SMS4. These findings raise serious questions on the security provided by SMS4.