|
|
Square Bttack on CLEFIA |
Tang Xue-hai①; Li Chao①②; Xie Duan-qiang① |
①Department of Mathematics and System Science, National University of Defense Technology, Changsha 410073, China; ②National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China |
|
|
Abstract According to the structure properties of CLEFIA , new 8-round distinguishers for Square attack are presented, and the wrong 8-round distinguishers originally found by the designers are pointed out. Based on the new distinguisher, the square attack on CLEFIA can be improved as follows: 10-round CLEFIA-128\192\256 is attacked with data complexity 297 and time complexity 292.7, 11-round CLEFIA-192/256 is attacked with data complexity 298 and time complexity 2157.6, and 12-round CLEFIA-256 is breakable with data complexity 298.6 and time complexity 2222. These results demonstrate that under the case of 10-round CLEFIA, both data and time complexity of our attack are better than those given by the designers.
|
Received: 19 September 2008
|
|
|
|
|
|
|
|