New Results on Impossible Differential Cryptanalysis of Reduced–Round Camellia–128

  • Hamid Mala
  • Mohsen Shakiba
  • Mohammad Dakhilalian
  • Ghadamali Bagherikaram
Conference paper

DOI: 10.1007/978-3-642-05445-7_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5867)
Cite this paper as:
Mala H., Shakiba M., Dakhilalian M., Bagherikaram G. (2009) New Results on Impossible Differential Cryptanalysis of Reduced–Round Camellia–128. In: Jacobson M.J., Rijmen V., Safavi-Naini R. (eds) Selected Areas in Cryptography. SAC 2009. Lecture Notes in Computer Science, vol 5867. Springer, Berlin, Heidelberg

Abstract

Camellia, a 128–bit block cipher which has been accepted by ISO/IEC as an international standard, is increasingly being used in many cryptographic applications. In this paper, using the redundancy in the key schedule and accelerating the filtration of wrong pairs, we present a new impossible differential attack to reduced–round Camellia. By this attack 12–round Camellia–128 without FL/FL− 1 functions and whitening is breakable with a total complexity of about 2116.6 encryptions and 2116.3 chosen plaintexts. In terms of the numbers of the attacked rounds, our attack is better than any previously known attack on Camellia–128.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Hamid Mala
    • 1
  • Mohsen Shakiba
    • 1
  • Mohammad Dakhilalian
    • 1
  • Ghadamali Bagherikaram
    • 2
  1. 1.Cryptography & System Security Research Laboratory, Department of Electrical and Computer EngineeringIsfahan University of TechnologyIsfahanIran
  2. 2.Department of Electrical and Computer EngineeringUniversity of WaterlooWaterlooCanada

Personalised recommendations