Abstract
This paper studies security against truncated differential cryptanalysis from the “designer’s” standpoint. In estimating the security, we use the upper bound of truncated differential probability. Previous works, Knudsen, Matsui and Moriai et al., searched for effective truncated differentials to attack byte-oriented block ciphers and computed the exact probability of the differentials. In this paper, we discuss the following items from the designer’s standpoint; (a) truncated differential probability of effective active-s-box, (b) XOR cancellation probability, and (c) effect of auxiliary functions, e.g., FL/FL -1-functions. We then combine them with Matsui’s search algorithm and evaluate the security of Camellia, jointly developed by NTT and Mitsubishi Electric Corporation, against truncated differential cryptanalysis. We prove (from the designer’s standpoint) that variants of Camellia with more than 11 rounds are secure against truncated differential cryptanalysis even if weak-key FL/FL -1-functions are taken into consideration.
Chapter PDF
References
K. Aoki, T. Ichikawa, M. Kanda, M. Matsui, S. Moriai, J. Nakajima, and T. Tokita, “Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms,” Selected Areas in Cryptography — 7th Annual International Workshop, SAC2000, pp. 41–54 in preproceeding, 2000, (LNCS to appear).
E. Biham and A. Shamir, “Differential Cryptanalysis of the Data Encryption Standard,” Springer-Verlag, Berlin, 1993.
R. Anderson, E. Biham, and L. R. Knudsen, “SERPENT,” The First Advanced Encryption Standard Candidate Conference, 1998. http://www.cl.cam.ac.uk/~rja14/serpent.html
J. Daemen, L. Knudsen, and V. Rijmen, “The block cipher Square,” Fast Software Encryption — 4th International Workshop, FSE’97, LNCS 1267, pp. 54–68, Springer-Verlag, Berlin, 1997.
J. Daemen and V. Rijmen, “RIJNDAEL,” The First Advanced Encryption Standard Candidate Conference, 1998. http://www.esat.kuleuven.ac.be/~rijmen/rijndael/
L. R. Knudesen, “Truncated and Higher Order Differentials,/rd Fast Software Encryption — Second International Workshop, LNCS 1008, pp. 196–211, Springer-Verlag, Berlin, 1995.
L. R. Knudsen and T. A. Berson, “Truncated Differentials of SAFER,” Fast Software Encryption — Third International Workshop, LNCS 1039, pp. 15–26, Springer-Verlag, Berlin, 1996.
M. Kanda, S. Moriai, K. Aoki, H. Ueda, Y. Takashima, K. Ohta, and T. Matsumoto, “E2 — A New 128-Bit Block Cipher,” IEICE Transactions Fundamentals of Electronics, Communications and Computer Sciences, Vol. E83-A, No. 1, pp. 48–59, 2000.
M. Matsui, “New Block Encryption Algorithm MISTY,” Fast Software Encryption — 4th International Workshop, FSE’97, LNCS 1267, pp. 54–68, Springer-Verlag, Berlin, 1997.
M. Matsui, “Differential Path Search of the Block Cipher E2,” IEICE Technical report, ISEC99-19, 1999-07. (In Japanese.)
M. Matsui and T. Tokita, “Cryptanalysis of a Reduced Version of the Block Cipher E2,” Fast Software Encryption — 6th International Workshop, FSE’99, LNCS 1636, pp. 71–80, Springer-Verlag, Berlin, 1999.
S. Moriai, M. Sugita, K. Aoki, and M. Kanda, “Security of E2 against Truncated Differential Cryptanalysis,” Selected Areas in Cryptography — 6th Annual International Workshop, SAC’99, LNCS 1758, pp. 106–117, Springer-Verlag, Berlin, 2000.
V. Rijmen, J. Daemen, B. Preneel, A. Bosselaers, and E.D. Win, “The cipher SHARK,” Fast Software Encryption — Third International Workshop, LNCS 1039, pp. 99–111, Springer-Verlag, Berlin, 1996.
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
Kanda, M., Matsumoto, T. (2002). Security of Camellia against Truncated Differential Cryptanalysis. 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_24
Download citation
DOI: https://doi.org/10.1007/3-540-45473-X_24
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