Abstract
In this paper, some observations on Camellia are presented, by which the Square attack and the Collision attack are improved. 11-round 256-bit Camellia without FL function is breakable with complexity of 2250 encryptions. 9-round 128-bit Camellia without FL function is breakable with the complexity of 290 encryptions. And 10-round 256-bit Camellia with FL function is breakable with the complexity of 2210 encryptions and 9-round 128-bit Camellia with FL function is breakable with the complexity of 2 122 encryptions. These results are better than any other known results. It concludes that the most efficient attack on Camellia is Square attack. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Lei, D., Chao, L., & Feng, K. (2006). New observation on Camellia. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3897 LNCS, pp. 51–64). https://doi.org/10.1007/11693383_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
