Improved cryptanalysis of the block cipher KASUMI

10Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

KASUMI is a block cipher which consists of eight Feistel rounds with a 128-bit key. Proposed more than 10 years ago, the confidentiality and integrity of 3G mobile communications systems depend on the security of KASUMI. In the practically interesting single key setting, only up to 6 rounds have been attacked so far. In this paper we use some observations on the FL and FO functions. Combining these observations with a key schedule weakness, we select some special input and output values to refine the general 5-round impossible differentials and propose the first 7-round attack on KASUMI with time and data complexities similar to the previously best 6-round attacks. This leaves now only a single round of security margin. The new impossible differential attack on the last 7 rounds needs 2114.3 encryptions with 252.5 chosen plaintexts. For the attack on the first 7 rounds, the data complexity is 262 known plaintexts and the time complexity is 2115.8 encryptions. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Jia, K., Li, L., Rechberger, C., Chen, J., & Wang, X. (2013). Improved cryptanalysis of the block cipher KASUMI. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7707 LNCS, pp. 222–233). https://doi.org/10.1007/978-3-642-35999-6_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free