Abstract
The block cipher MISTY1 [9] proposed for the NESSIE project [11] is a Feistel network augmented with key-dependent linear FL functions. The proposal allows a variable number of rounds provided that it is a multiple of four.
Here we present a new attack - the Slicing Attack - on the 4-round version, which makes use of the special structure and position of these key-dependent linear FL functions. While the FL functions were introduced to make attacks harder, they also present a subtle weakness in the 4-round version of the cipher.
Chapter PDF
Similar content being viewed by others
References
E. Biham, A. Biryukov, and A. Shamir. Miss in the middle attacks on IDEA and Khufu. In L. Knudsen, editor, Fast Software Encryption, 6th international Workshop, volume 1636 of Lecture Notes in Computer Science, pages 124–138, Rome, Italy, 1999. Springer-Verlag.
E. Biham and A. Shamir. Differential Cryptanalysis of the Data Encryption Standard. Springer Verlag, Berlin, 1993.
K. L. Chung. Elementary Probability Theory with Stochastic Processes. Springer Verlag, 1979.
ETSI/SAGE. Specification of the 3GPP Confidentiality and Integrity Algorithms-Document 2: KASUMI Specification, Version 1.0. 3G TS 35.202, December 23, 1999. http://www.etsi.org/dvbandca/3GPP/3GPPconditions.html.
L. R. Knudsen. DEAL — A 128-bit block cipher. Technical Report 151, Department of Informatics, University of Bergen, Bergen, Norway, Feb. 1998.
L. R. Knudsen and D. Wagner. Integral cryptanalysis. These Proceedings, pages 114–129.
U. Kühn. Cryptanalysis of Reduced-Round MISTY. In B. Pfitzmann, editor, Advances in Cryptology — EUROCRYPT 2001, volume 2045 of Lecture Notes in Computer Science, pages 325–339. Springer Verlag, 2001.
M. Matsui. Linear cryptanalysis method for DES cipher. In T. Helleseth, editor, Advances in Cryptology — EUROCRYPT’ 93, pages 386–397, Berlin, 1993. Springer-Verlag. Lecture Notes in Computer Science Volume 765.
M. Matsui. New block encryption algorithm MISTY. In E. Biham, editor, Fast Software Encryption: 4th International Workshop, volume 1267 of Lecture Notes in Computer Science, pages 54–68, Haifa, Israel, 20–22 Jan. 1997. Springer-Verlag.
R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, NY, 1995.
NESSIE. New European Schemes for Signature, Integrity, and Encryption. http://www.cryptonessie.org.
H. Tanaka, K. Hisamatsu, and T. Kaneko. Strength of MISTY1 without FL function for higher order differential attack. In M. Fossorier, H. Imai, S. Lin, and A. Poli, editors, Proc. Applied algebra, algebraic algorithms, and error-correcting codes: 13th international symposium, AAECC-13, volume 1719 of Lecture Notes in Computer Science, pages 221–230, Hawaii, USA, 1999. Springer Verlag.
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
Kühn, U. (2002). Improved Cryptanalysis of MISTY1. In: Daemen, J., Rijmen, V. (eds) Fast Software Encryption. FSE 2002. Lecture Notes in Computer Science, vol 2365. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45661-9_5
Download citation
DOI: https://doi.org/10.1007/3-540-45661-9_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44009-3
Online ISBN: 978-3-540-45661-2
eBook Packages: Springer Book Archive