Skip to main content
Log in

Practical security against linear cryptanalysis for SMS4-like ciphers with SP round function

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

SMS4, a block cipher whose global structure adopts a special unbalanced Feistel scheme with SP round function, is accepted as the Chinese National Standard for securing Wireless LANs. In this paper, in order to evaluate the security against linear cryptanalysis, we examine the upper bound of the maximum linear characteristic probability of SMS4-like ciphers with SP round function. In the same way as for SPN ciphers, it is sufficient to consider the lower bound of the number of linear active s-boxes. We propose a formula to compute the lower bound of the number of linear active s-boxes with regard to the number of rounds. The security threshold of SMS4-like ciphers can be estimated easily with our result. Furthermore, if the number of input words in each round of SMS4-like cipher is m, we find that it is unnecessary for designers to make the linear branch number of P greater than 2m with respect to linear cryptanalysis.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Biham E, Shamir A. Differential cryptanalysis of DES-like cryptosystems. In: CRYPTO 1990. LNCS, vol. 537. Berlin: Springer-Verlag, 1991. 386–397

    Google Scholar 

  2. Matsui M. Linear cryptanalysis method for DES cipher. In: EUROCRYPT 1993. LNCS, vol. 765. Berlin: Springer-Verlag, 1994. 386–397

    Google Scholar 

  3. Knudsen L. Practically secure Feistel cipher. In: FSE 1993. LNCS, vol. 809. Berlin: Springer-Verlag, 1994. 211–221

    Google Scholar 

  4. Kanda M. Practical security evaluation against differential and linear cryptanalyses for Feistel ciphers with SPN round function. In: SAC 2000. LNCS, vol. 2012. Berlin: Springer-Verlag, 2001. 324–338

    Google Scholar 

  5. Ohta K, Moriai S, Aoki K. Improving the search algorithm for the best linear expression. In: CRYPTO 1995. LNCS, vol. 963. Berlin: Springer-Verlag, 1995. 157–170

    Google Scholar 

  6. Matsui M. On correlation between the order of s-boxes and the strength of DES. In: EUROCRYPT 1993. LNCS, vol. 765. Berlin: Springer-Verlag, 1994. 366–375

    Google Scholar 

  7. Kanda M, Matsumoto T. Security of Camellia against truncated differential cryptanalysis. In: FSE 2001. LNCS, vol. 2355. Berlin: Springer-Verlag, 2002. 286–299

    Google Scholar 

  8. Shirai T, Kanamaru S, Abe G. Improved upper bounds of differential and linear characteristic probability for Camellia. In: FSE 2002. LNCS, vol. 2365. Berlin: Springer-Verlag, 2002. 128–142

    Google Scholar 

  9. Shirai T, Preneel B. On Feistel ciphers using optimal diffusion mappings across multiple rounds. In: ASIACRYPT 2004. LNCS, vol. 3329. Berlin: Springer-Verlag, 2004. 1–15

    Chapter  Google Scholar 

  10. Wu W L, He Y P. Security evaluation for a class of generalized Feistel ciphers (in Chinese). J Electr Inf Tech, 2002, 24: 1177–1184

    Google Scholar 

  11. Zhang R W. Linear cryptanalysis for a class of generalized Feistel ciphers (in Chinese). J GUCAS, 2003, 20: 31–38

    MATH  Google Scholar 

  12. Wu W L, Zhang W T, Lin D D. On the security of generalized Feistel scheme with SP round function. Int J Netw Secur, 2006, 3: 215–224

    Google Scholar 

  13. Wang N P. Security analysis for a class of generalized Feistel ciphers (in Chinese). J Dalian Maritime Univ, 2007, 33: 63–67

    Google Scholar 

  14. Rijmen V, Daemon J, Preneel B, et al. The cipher SHARK. In: FSE 1996. LNCS, vol. 1039. Berlin: Springer-Verlag, 1996. 99–111

    Google Scholar 

  15. Kang J S, Park C, Lee S, et al. On the optimal diffusion layers with practical security against differential and linear cryptanalysis. In: ICISC 1999. LNCS, vol. 1787. Berlin: Springer-Verlag, 2000. 38–52

    Google Scholar 

  16. Daemen J, Rijmen V. The wide trail design strategy. In: Cryptography and Coding 2001. LNCS, vol. 2260. Berlin: Springer-Verlag, 2001. 222–238

    Chapter  Google Scholar 

  17. Kang J S, Hong S, Lee S, et al. Practical and provable security against differential and linear cryptanalysis for substitution-permutation networks. ETRI J, 2001, 23: 158–167

    Article  Google Scholar 

  18. Ali K. An algorithm to analyze substitution permutation network resistance to linear and differential cryptanalysis. Dissertation for the Master Degree, Faculty of Engineering and Applied Science Memorial University of Newfoundland, Canada, 2007

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bin Zhang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, B., Jin, C. Practical security against linear cryptanalysis for SMS4-like ciphers with SP round function. Sci. China Inf. Sci. 55, 2161–2170 (2012). https://doi.org/10.1007/s11432-011-4448-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-011-4448-8

Keywords

Navigation