Abstract
Camellia is a 128-bit block cipher, proposed by NTT and Mitsubishi in 2000. It has been shown that 10 round variant without FL function under a 256-bit secret key is attackable by Higher Order Differential Attack and even if FL function is included, 9 round variant is attackable by Square Attack. In this paper, we present a new attack of Camellia using 16-th order Differential and show that 11 round variant without FL function is attackable. Moreover, we show that 11 round variant with FL function is attackable, if we use chosen ciphertexts for this attack.
We call that paper “Higher Order Differential Attack of Camellia (I)”
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
K. Aoki, T. Ichikawa, M. Kanda, M. Matsui, S. Moriai, J. Nakajima, and T. Tokita, “The 128-Bit Block Cipher Camellia,” IEIEC Trans. Fundamentals, Vol.E85-A, No.1, pp.11–24, Jan, 2002.
K. Aoki, T. Ichikawa, M. Kanda, M. Matsui, S. Moriai, J. Nakajima, and T. Tokita, “Camellia —A 128-Bit Block Cipher Camellia,”Technical Report of IEICE, ISEC2000.
N. Furguson, J. Kelsey, S. Luck, B. Schneier, M. Stay, D. Wagner, and D. Whiting, “Improved Cryptanalysis of Rijndael,” Seventh Fast Software Encryption Workshop, 2000.
Y. He, and S. Quing, “Square Attack on Reduced Round Camemllia Cipher,” ICISC 2001, LNCS 2229, Springer-Verlag, pp.213–230, 2000.
T. Iwata, and K. Kurosawa,“Probabilistic Higher Order Differential Attack and Secure Boolean Functions”,The 2000 Symposium on Cryptography and Information Security, SCIS2000-A-46, Okinawa, Japan, Jan.26–28, 2000.
M. Kanda, and T. Matsumoto, “On the Security of Feistel Cipher with SPN Round Function against Differential, Linear, and Truncated Differential Cryptanalysis,” IEIEC Trans. Fundamentals, Vol.E85-A, No.1, pp.25–37, Jan, 2002.
T. Kawabata, and T. Kaneko, “A Study on Higher Order Differential Attack of Camellia,” Second Open, NESSIE Workshop, Londom, U.K, Sep. 2001.
Lar R. Knudsen “The Interpolation Attack on Block Cipher,” Fast Software Encryption 4-th International Workshop, LNCS.1008, Springer-Verlag. Berlin, 1996.
X. Lai, “Higher Order Derivatives and Differential Cryptanalysis,” Communications and Cryptography, pp.227–233, Kluwer Academic Publishers, 1994.
S. Lee, S. Hong, S. Lee, J. Lim, and S. Yoon, “Truncated Differential Cryptanalysis of Camellia,” ICISC2001.
T. Shimoyama, S. Moriai, and T. Kaneko, “Higher Order Differential Attack of a CAST Cipher,” Fast Software Encryption 4-th International Workshop, LNCS.1372, Springer-Verlag. Berlin, 1996.
T. Shirai, S, Kanamaru, and G. Abe, “Improved Upper Bounds of Differential and Linear Characteristic Probability for Camellia” Fast Software Encryption 2002, FSE2002, pp.123–137, Lenven, Belgium, Feb, 2002.
M. Takeda, and T. Kaneko, “A Study for Controled Higher Order Differential Cryptanalysis of Camellia,” The 2002 Symposium on Cryptography and Information Security, SCIS2002, Shirahama, Japan, Jan.29–Feb.1, 2002. (in Japanese).
H. Tanaka, K. Hisamatsu, and T. Kaneko, “Strength ofMISTY1 without FL function for Higher Order Differential Attack,” Applied Algebra, Algebraic Algorithm and Error Correcting Codes Symposium(AAECC13), LNCS.1719 pp.221–230, 1999.
Y. Yeom, S. Park, and I. Kim, “On the Security of Camellia against the Square Attack,” Fast Software Encryption 2002, FSE2002, pp.84–93, Lenven, Belgium, Feb, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hatano, Y., Sekine, H., Kaneko, T. (2003). Higher Order Differential Attack of Camellia(II). In: Nyberg, K., Heys, H. (eds) Selected Areas in Cryptography. SAC 2002. Lecture Notes in Computer Science, vol 2595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36492-7_10
Download citation
DOI: https://doi.org/10.1007/3-540-36492-7_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00622-0
Online ISBN: 978-3-540-36492-4
eBook Packages: Springer Book Archive