Conference ProceedingsOPEN ACCESS

Square like attack on Camellia

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4861 LNCS 269-283
DOI: 10.1007/978-3-540-77048-0_21
27Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, a square like attack on Camellia is presented, by which 9-round 128-bit key Camellia without FL/FL-1 functions layer and whitening is breakable with complexity of 286.9 encryptions and 266 data and 12-round 256-bit key Camellia without FL/FL-1 function layer and whitening is breakable with the complexity of 2 250.8 encryptions and 266 data. And we can also apply such method to block cipher having XORing sBoxes in diffusion layer. © Springer-Verlag Berlin Heidelberg 2007.

Author supplied keywords

Cite

CITATION STYLE

APA

Duo, L., Li, C., & Feng, K. (2007). Square like attack on Camellia. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4861 LNCS, pp. 269–283). Springer Verlag. https://doi.org/10.1007/978-3-540-77048-0_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free