Improved automatic search of impossible differentials for camellia with FL/FL ⁻¹ layers

1. Wu S, Wang M. Automatic search of truncated impossible differentials for word-oriented block ciphers. In: Proceedings of International Conference on Cryptology in India, Kolkata, 2012. 283–302

   MATH  Google Scholar 

2. Chen J. Cryptanalysis of several block ciphers. Dissertation for Ph.D. Degree. Jinan: Shandong Univercity, 2012

   Google Scholar 

3. Liu Y, Li L, Gu D, et al. New observations on impossible differential cryptanalysis of reduced-round Camellia. In: Proceedings of the 19th International Conference on Fast Software Encryption, Washington, 2012. 90–109

   MATH  Google Scholar 

4. Bai D, Li L. New impossible differential attacks on camellia. In: Proceedings of International Conference on Information Security Practice and Experience, Hangzhou, 2012. 80–96

   MATH  Google Scholar 

5. Blondeau C. Impossible differential attack on 13-round Camellia-192. Inf Process Lett, 2015, 115: 660–666

   Article  MathSciNet  MATH  Google Scholar 

6. Boura C, Naya-Plasencia M, Suder V. Scrutinizing and improving impossible differential attacks: applications to CLEFIA, Camellia, LBlock and Simon. In: Advances in Cryptology — ASIACRYPT. Berlin: Springer, 2014. 8873: 179–199

   MATH  Google Scholar 

7. Aoki K, Ichikawa T, Kanda M, et al. Camellia: a 128-bit block cipher suitable for multiple platforms design and analysis. In: Proceedings of International Workshop on Selected Areas in Cryptography, Ontario, 2000. 39–56

   MATH  Google Scholar 

8. Li L, Jia K, Wang X, et al. Meet-in-the-middle technique for truncated differential and its applications to CLEFIA and camellia. In: Proceedings of International Workshop on Fast Software Encryption, Istanbul, 2015. 48–70

   MATH  Google Scholar 

Download references