Analysis of the SMS4 block cipher

Liu Fen; Ji Wen; Hu Lei; Ding Jintai; Lv Shuwang; Andrei Pyshkin; Ralf Philipp Weinmann

Analysis of the SMS4 block cipher

Liu Fen^*, Ji Wen, Hu Lei, Ding Jintai, Lv Shuwang, Andrei Pyshkin, Ralf Philipp Weinmann

^*Corresponding author for this work

Research output: Chapter in Book or Report/Conference proceeding › Conference Proceeding › peer-review

38 Citations (Scopus)

Abstract

SMS4 is a 128-bit block cipher used in the WAPI standard for providing data confidentiality in wireless networks. In this paper we investigate and explain the origin of the S-Box employed by the cipher, show that an embedded cipher similar to BES can be obtained for SMS4 and demonstrate the fragility of the cipher design by giving variants that exhibit 2⁶⁴ weak keys. We also show attacks on reduced round versions of the cipher. The best practical attack we found is an integral attack that works on 10 rounds out of 32 rounds with a complexity of 2¹⁸ operations; it can be extended to 13 rounds using round key guesses, resulting in a complexity of 2¹¹⁴ operations and a data complexity of 2¹⁶ chosen pairs.

Original language	English
Title of host publication	Information Security and Privacy - 12th Australasian Conference, ACISP 2007, Proceedings
Pages	158-170
Number of pages	13
Publication status	Published - 2007
Externally published	Yes
Event	12th Australasian Conference on Information Security and Privacy, ACISP2007 - Townsville, Australia Duration: 2 Jul 2007 → 4 Jul 2007

Publication series

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

Conference

Conference	12th Australasian Conference on Information Security and Privacy, ACISP2007
Country/Territory	Australia
City	Townsville
Period	2/07/07 → 4/07/07

Keywords

Algebraic structure
Block ciphers
Cryptanalysis
UFN

Cite this

Fen, L., Wen, J., Lei, H., Jintai, D., Shuwang, L., Pyshkin, A., & Weinmann, R. P. (2007). Analysis of the SMS4 block cipher. In Information Security and Privacy - 12th Australasian Conference, ACISP 2007, Proceedings (pp. 158-170). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4586 LNCS).

@inproceedings{8f4194566b8144668ca7fc4e1a945fc1,

title = "Analysis of the SMS4 block cipher",

abstract = "SMS4 is a 128-bit block cipher used in the WAPI standard for providing data confidentiality in wireless networks. In this paper we investigate and explain the origin of the S-Box employed by the cipher, show that an embedded cipher similar to BES can be obtained for SMS4 and demonstrate the fragility of the cipher design by giving variants that exhibit 264 weak keys. We also show attacks on reduced round versions of the cipher. The best practical attack we found is an integral attack that works on 10 rounds out of 32 rounds with a complexity of 218 operations; it can be extended to 13 rounds using round key guesses, resulting in a complexity of 2114 operations and a data complexity of 216 chosen pairs.",

keywords = "Algebraic structure, Block ciphers, Cryptanalysis, UFN",

author = "Liu Fen and Ji Wen and Hu Lei and Ding Jintai and Lv Shuwang and Andrei Pyshkin and Weinmann, {Ralf Philipp}",

year = "2007",

language = "English",

isbn = "3540734570",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "158--170",

booktitle = "Information Security and Privacy - 12th Australasian Conference, ACISP 2007, Proceedings",

note = "12th Australasian Conference on Information Security and Privacy, ACISP2007 ; Conference date: 02-07-2007 Through 04-07-2007",

}

Fen, L, Wen, J, Lei, H, Jintai, D, Shuwang, L, Pyshkin, A & Weinmann, RP 2007, Analysis of the SMS4 block cipher. in Information Security and Privacy - 12th Australasian Conference, ACISP 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4586 LNCS, pp. 158-170, 12th Australasian Conference on Information Security and Privacy, ACISP2007, Townsville, Australia, 2/07/07.

Analysis of the SMS4 block cipher. / Fen, Liu; Wen, Ji; Lei, Hu et al.
Information Security and Privacy - 12th Australasian Conference, ACISP 2007, Proceedings. 2007. p. 158-170 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4586 LNCS).

Research output: Chapter in Book or Report/Conference proceeding › Conference Proceeding › peer-review

TY - GEN

T1 - Analysis of the SMS4 block cipher

AU - Fen, Liu

AU - Wen, Ji

AU - Lei, Hu

AU - Jintai, Ding

AU - Shuwang, Lv

AU - Pyshkin, Andrei

AU - Weinmann, Ralf Philipp

PY - 2007

Y1 - 2007

N2 - SMS4 is a 128-bit block cipher used in the WAPI standard for providing data confidentiality in wireless networks. In this paper we investigate and explain the origin of the S-Box employed by the cipher, show that an embedded cipher similar to BES can be obtained for SMS4 and demonstrate the fragility of the cipher design by giving variants that exhibit 264 weak keys. We also show attacks on reduced round versions of the cipher. The best practical attack we found is an integral attack that works on 10 rounds out of 32 rounds with a complexity of 218 operations; it can be extended to 13 rounds using round key guesses, resulting in a complexity of 2114 operations and a data complexity of 216 chosen pairs.

AB - SMS4 is a 128-bit block cipher used in the WAPI standard for providing data confidentiality in wireless networks. In this paper we investigate and explain the origin of the S-Box employed by the cipher, show that an embedded cipher similar to BES can be obtained for SMS4 and demonstrate the fragility of the cipher design by giving variants that exhibit 264 weak keys. We also show attacks on reduced round versions of the cipher. The best practical attack we found is an integral attack that works on 10 rounds out of 32 rounds with a complexity of 218 operations; it can be extended to 13 rounds using round key guesses, resulting in a complexity of 2114 operations and a data complexity of 216 chosen pairs.

KW - Algebraic structure

KW - Block ciphers

KW - Cryptanalysis

KW - UFN

UR - http://www.scopus.com/inward/record.url?scp=38149070897&partnerID=8YFLogxK

M3 - Conference Proceeding

AN - SCOPUS:38149070897

SN - 3540734570

SN - 9783540734574

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 158

EP - 170

BT - Information Security and Privacy - 12th Australasian Conference, ACISP 2007, Proceedings

T2 - 12th Australasian Conference on Information Security and Privacy, ACISP2007

Y2 - 2 July 2007 through 4 July 2007

ER -

Analysis of the SMS4 block cipher

Abstract

Publication series

Conference

Keywords

Other files and links

Fingerprint

Cite this