Abstract
This paper describes truncated and impossible differential cryptanalysis of the 128-bit block cipher Camellia, which was proposed by NTT and Mitsubishi Electric Corporation. Our work improves on the best known truncated and impossible differential cryptanalysis. As a result, we show a nontrivial 9-round byte characteristic, which may lead to a possible attack of reduced-round version of Camellia without input/output whitening, FL or FL -1 in a chosen plain text scenario. Previously, only 6-round differentials were known, which may suggest a possible attack of Camellia reduced to 8-rounds. Moreover, we show a nontrivial 7-round impossible differential, whereas only a 5-round impossible differential was previously known. This cryptanalysis is effective against general Feistel structures with round functions composed of S-D (Substitution and Diffusion) transformation.
Chapter PDF
Similar content being viewed by others
Keywords
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 Platform” http://info.isl.ntt.co.jp/camellia/
E. Biham, O. Dunkelman, V. Furman, T. Mor, “Preliminary report on the NESSIE submissions Anubis, Camellia, IDEA, Khazad, Misty1, Nimbus, Q,” NESSIE public report.
E. Biham and A. Shamir, “Differential Cryptanalysis of DES-like Cryptosystems.” Journal of Cryptology, Vol.4, No.1, pp.3–72, 1991. (The extended abstract was presented at CRYPTO’90).
L.R. Knudsen and T.A. Berson, “Truncated Differentials of SAFER.” In Fast Software Encryption-Third International Workshop, FSE’96, Volume 1039 of Lecture Notes in Computer Science, Berlin, Heidelberg, NewYork, Springer-Verlag, 1996.
M. Kanda et al. “A New 128-bit Block Cipher E2,” IEICE Trans. fundamentals, Vol.E83-A, No.1, Jan., 2000.
M. Kanda and T. Matsumoto, “Security of Camellia against Truncated Differential Cryptanalysis,” In Fast Software Encryption-8th International Workshop, FSE’00.
T. Kawabata, Y. Ohgaki, T. Kaneko, “A study on Strength of Camellia against Higher Order Differential Attack,” Technical Report of IEICE. ISEC 2001-9, pp.55–62.
X. Lai, J.L. Massey and S. Murphy, “Markov Ciphers and Differential Cryptanalysis,” Advances in Cryptography-EUROCRYPT’ 91. Lecture Notes in Computer Science, Vol. 576. Springer-Verlag, Berlin, 1992, pp.86–100.
A.J. Menezes, P.C. van Oorschot, S.A. Vanstone, “Handbook of Applied Cryptography”, CRC Press, pp.250–250 (1997).
A. Moriai, M. Sugita, K. Aoki, M. Kanda, “Security of E2 against truncated Differential Cryptanalysis” Sixth Annual Workshop on Selected Areas in Cryptography (SAC’99), LNCS 1758 pp.106–117, Springer Verlag, Berlin, 1999.
S. Moriai, M. Sugita and M. Kanda, “Security of E2 against truncated Differential Cryptanalysis” IEICE, Trans. fundamentals, Vol.E84-A NO.1, pp.319–325, January 2001.
M. Matsui, and T. Tokita, “Cryptanalysis of a Reduced Version of the Block Cipher E2” in 6-th international workshop, preproceedings FSE’99
K. Nyberg and L.R. Knudsen, “Provable security against a differential attack,” in Advances in Cryptology-EUROCRYTO’93, LNCS 765, pp.55–64, Springer-Verlag, Berlin, 1994.
M. Sugita, K. Kobara, H. Imai, “Pseudorandomness and Maximum Average of Differential Probability of Block Ciphers with SPN-Structures like E2.” Second AES Workshop, 1999.
M. Sugita, K. Kobara, H. Imai, “Relationships among Differential, Truncated Differential, Impossible Differential Cryptanalyses against Block-Oriented Block Ciphers like RIJNDAEL, E2” Third AES Workshop, 2000.
T. Tokita, M. Matsui, “On cryptanalysis of a byte-oriented cipher”, The 1999 Symposium on Cryptography and Information Security, pp.93–98 (In Japanese), Kobe, Japan, January 1999.
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
Sugita, M., Kobara, K., Imai, H. (2001). Security of Reduced Version of the Block Cipher Camellia against Truncated and Impossible Differential Cryptanalysis. In: Boyd, C. (eds) Advances in Cryptology — ASIACRYPT 2001. ASIACRYPT 2001. Lecture Notes in Computer Science, vol 2248. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45682-1_12
Download citation
DOI: https://doi.org/10.1007/3-540-45682-1_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42987-6
Online ISBN: 978-3-540-45682-7
eBook Packages: Springer Book Archive