Abstract
The encryption algorithm KASUMI is referred to MISTY, proposed by Matsui, is a provably secure against Linear cryptoanalysis and Differential attack. We attacked KASUMI without FL functions by using Higher Order Differential Attack. The necessary order of Higher Order Differential Attack depends on the degree of F function and it is determined by the chosen plaintext. We found effective chosen plaintext which enables the attack to 4 round KASUMI without FL functions. As the result, we can attack it using 2nd order differentials. This attack needs about 1,416 chosen plaintexts.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
“KASUMI”, available at http://www.etsi.org/dvbandca/3GPP/3gppspecs.htm
Matui, “Block Encryption Algorithm MISTY”, ISEC96-11(1996-07)
Shimoyama, Moriai, Kaneko, “Improving the Higher Order Di erential Attack and Cryptanalysis of the KN Cipher”, ISEC97-29(1997-09)
Moriai, Shimoyama, Kaneko, “Higher Order Attack of a CAST Cipher (II)”, SCIS98-12E
Jakobsen, Knudsen, “The Interpolation Attack on Block Cipher”, FSE-4th International Workshop, LNCS.1008
Nyberg, Knudsen, “Provable Security against Differential Cryptanalsis”, Jounal of Cryptology, Vol.8-no.1 (1995)
Shimoyama, Moriai, Kaneko, “Improving the Higher Order Differential Attack and Cryptanalysis of the KN Cipher”, 1997 Information Security Workshop
Matsui, “New Structure of Block Ciphers with Provable Security against Differential and Linear cryptanalysis”, FSE-3rd International Workshop, LNCS.1039
Moriai, Shimoyama, Kaneko, “Higher Order Attack of a CAST Cipher”, FSE-4th International Workshop, LNCS.1372
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tanaka, H., Ishii, C., Kaneko, T. (2001). On the strength of KASUMI without FL functions against Higher Order Differential Attack. In: Won, D. (eds) Information Security and Cryptology — ICISC 2000. ICISC 2000. Lecture Notes in Computer Science, vol 2015. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45247-8_2
Download citation
DOI: https://doi.org/10.1007/3-540-45247-8_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41782-8
Online ISBN: 978-3-540-45247-8
eBook Packages: Springer Book Archive