Camellia: a 128-bit block cipher and suitable for multiple platforms -- design and analysis. We present a new 128-bit block cipher called Camellia. Camellia supports 128-bit block size and 128-, 192-, and 256-bit keys, i.e., the same interface specifications as the Advanced Encryption Standard (AES). Efficiency on both software and hardware platforms is a remarkable characteristic of Camellia in addition to its high level of security. It is confirmed that Camellia provides strong security against differential and linear cryptanalyses. Compared to the AES finalists, i.e., MARS, RC6, Rijndael, Serpent, and Twofish, Camellia offers at least comparable encryption speed in software and hardware. An optimized implementation of Camellia in assembly language can encrypt on a Pentium III (800 MHz) at the rate of more than 276 Mbits per second, which is much faster than the speed of an optimized DES implementation. In addition, a distinguishing feature is its small hardware design. The hardware design, which includes encryption and decryption and key schedule, occupies approximately 11K gates, which is the smallest among all existing 128-bit block ciphers as far as we know.

References in zbMATH (referenced in 80 articles )

Showing results 1 to 20 of 80.
Sorted by year (citations)

1 2 3 4 next

  1. Burov, Dmitry A.: Subgroups of direct products of groups invariant under the action of permutations on factors (2020)
  2. Gerault, David; Lafourcade, Pascal; Minier, Marine; Solnon, Christine: Computing AES related-key differential characteristics with constraint programming (2020)
  3. Aragona, Riccardo; Calderini, Marco; Civino, Roberto; Sala, Massimiliano; Zappatore, Ilaria: Wave-shaped round functions and primitive groups (2019)
  4. Aragona, Riccardo; Meneghetti, Alessio: Type-preserving matrices and security of block ciphers (2019)
  5. Burov, Dmitry A.: On relationship between the parameters characterizing nonlinearity and nonhomomorphy of vector spaces transformation (2019)
  6. Roberts, Nathan V.: Camellia: a rapid development framework for finite element solvers (2019)
  7. Yang, Dong; Qi, Wen-Feng; Chen, Hua-Jin: Provable security against impossible differential and zero correlation linear cryptanalysis of some Feistel structures (2019)
  8. Boura, Christina; Lallemand, Virginie; Naya-Plasencia, María; Suder, Valentin: Making the impossible possible (2018)
  9. Gérault, David; Lafourcade, Pascal; Minier, Marine; Solnon, Christine: Revisiting AES related-key differential attacks with constraint programming (2018)
  10. Hong, Deukjo; Koo, Bonwook; Seo, Changho: Differential property of \textscPresent-like structure (2018)
  11. Blondeau, Céline; Nyberg, Kaisa: Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity (2017)
  12. Calderini, M.; Sala, M.; Villa, I.: A note on APN permutations in even dimension (2017)
  13. Huang, Jialin; Yan, Hailun; Lai, Xuejia: Transposition of AES key schedule (2017)
  14. Roberts, Nathan V.; Chan, Jesse: A geometric multigrid preconditioning strategy for DPG system matrices (2017)
  15. Shen, Xuan; Liu, Guoqiang; Sun, Bing; Li, Chao: Impossible differentials of SPN ciphers (2017)
  16. Xu, Yuwei; Li, Yongqiang; Wu, Chuankun; Liu, Feng: On the construction of differentially 4-uniform involutions (2017)
  17. Ashur, Tomer; Rijmen, Vincent: On linear hulls and trails (2016)
  18. Derbez, Patrick; Fouque, Pierre-Alain: Automatic search of meet-in-the-middle and impossible differential attacks (2016)
  19. Gérault, David; Lafourcade, Pascal: Related-key cryptanalysis of Midori (2016)
  20. Guo, Jian; Jean, Jérémy; Nikolić, Ivica; Sasaki, Yu: Extended meet-in-the-middle attacks on some Feistel constructions (2016)

1 2 3 4 next