DocumentCode
3310980
Title
The Square Attack of Reduced-Round Camellia
Author
Yu, Xiaoli ; Wei, Hongru
Author_Institution
Appl. Sci. Sch., Univ. of Sci. & Technol. Beijing, Beijing
Volume
2
fYear
2009
fDate
25-26 April 2009
Firstpage
244
Lastpage
247
Abstract
Duo etl. gave some equivalent structures of Camellia and some observations on Camellia, but they misunderstood the key scheduling algorithm of Camellia and had the wrong complexity for some case. In this paper, we first give some four round distinguishers, then present the square attack to 7-round Camellia and 9-round Camellia, furthermore modify some analysis complexities. 7-round Camellia-128 is breakable with the complexity of 225.6 encryptions. 9-round Camellia-128 is breakable with the complexity of 2122 encryptions. 7-round Camellia-256 is break-able with the complexity of 225.6 encryptions. 9-round Camellia-256 is breakable with the complexity of 2122 encryptions. 11-round Camellia-256 is breakable with the complexity of 2250 encryptions.
Keywords
computational complexity; cryptography; scheduling; block cipher; encryption algorithm; reduced-round Camellia; scheduling algorithm complexity; square attack; Algorithm design and analysis; Computer networks; Cryptography; Electronic government; IEC standards; ISO standards; Portfolios; Scheduling algorithm; Security; Wireless communication; Square attack; block cipher; complexity; key;
fLanguage
English
Publisher
ieee
Conference_Titel
Networks Security, Wireless Communications and Trusted Computing, 2009. NSWCTC '09. International Conference on
Conference_Location
Wuhan, Hubei
Print_ISBN
978-1-4244-4223-2
Type
conf
DOI
10.1109/NSWCTC.2009.259
Filename
4908450
Link To Document