Abstract
This paper describes related key attacks on five and six round KASUMI. The five round attack requires the encryption of approximately 219 chosen plaintext pairs X and X* under keys K and K* respectively where K and K* differ in only one bit, and requires a maximum of a little over 233 trials to recover the entire key. The six round attack requires a smaller number of chosen plaintext encryptions than the five round attack, and recovers the entire key in a maximum of 2112 trials.
Part of this work was done while the authors were with BTexaCT, UK.
Chapter PDF
References
S. Babbage, ”Design of Security Algorithms for Third Generation Mobile Telephony.” In Information Security Technical Report (Elsevier), (5), 2000.
E. Biham, ”New Types of Cryptanalytic Attacks Using Related Keys.” In Advances in Cryptology-EUROCRYPT’ 93, Lecture Notes in Computer Science (LNCS 765), Springer-Verlag, 1994.
E. Biham and A. Shamir, ”Differential Cryptanalysis of DES-like Cryptosystems.” In Journal of Cryptology, (4), 1991.
J. Kelsey, B. Schneier and D. Wagner, ”Key-Schedule Cryptanalysis of IDEA, GDES, GOST, SAFER and Triple-DES.” In Advances in Cryptology-CRYPTO’ 96, Lecture Notes in Computer Science (LNCS 1109), Springer-Verlag, 1996.
L. Knudsen, ”Cryptanalysis of LOKI91.” In Advances in Cryptology-AUSCRYPT’ 92, Lecture Notes in Computer Science (LNCS 718), Springer-Verlag, 1994.
M. Matsui, ”New Block Encryption Algorithm MISTY.” In Fast Software Encryption: 4th International Workshop, Lecture Notes in Computer Science (LNCS 1267), Springer-Verlag, 1997.
K. Nyberg, ”Linear Approximation of Block Ciphers.” In Advances in Cryptology-EUROCRYPT’ 94, Lecture Notes in Computer Science (LNCS 950), Springer-Verlag, 1995.
K. Nyberg and L. Knudsen, ”Provable Security Against a Differential Attack.” In Journal of Cryptology, (8), 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blunden, M., Escott, A. (2002). Related Key Attacks on Reduced Round KASUMI. In: Matsui, M. (eds) Fast Software Encryption. FSE 2001. Lecture Notes in Computer Science, vol 2355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45473-X_23
Download citation
DOI: https://doi.org/10.1007/3-540-45473-X_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43869-4
Online ISBN: 978-3-540-45473-1
eBook Packages: Springer Book Archive