Sandwich-Boomerang attack on reduced round CLEFIA

作     者：毛明 Qin Zhiguang 

作者机构：School of Computer Science and EngineeringUniversity of Electronic Science and Technology of China 

出 版 物：《High Technology Letters》 (高技术通讯（英文版）)

年 卷 期：2014年第20卷第1期

页      面：48-53页

核心收录：

学科分类：08[工学] 0710[理学-生物学] 0831[工学-生物医学工程（可授工学、理学、医学学位）] 0810[工学-信息与通信工程] 1205[管理学-图书情报与档案管理] 0807[工学-动力工程及工程热物理] 0805[工学-材料科学与工程（可授工学、理学学位）] 0802[工学-机械工程] 0836[工学-生物工程] 081201[工学-计算机系统结构] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 0702[理学-物理学] 

基　　金：Supported by the National Science Foundation of China(No.60973161) the Doctoral Fund of Ministry of Education of China(No.200806140010) the National High Technology Research and Development Program of China(No.2009AA01Z422) 

主　　题：三明治 攻击 回旋 国际研讨会 SONY公司 密码分析 差分特征 时间复杂度 

摘      要：CLEFIA(named after the French word Clef meaning Key) is an efficient,highly secure block cipher proposed by SONY Corporation in the 14 th International Workshop on Fast Software Encryption(FSE-2007) and many cryptanalyses have been used to analyze it.According to the property of CLEFIA,a new technique Sandwich-Boomerang cryptanalysis is used on it.An 8-round Sandwich-Boomerang distinguisher of CLEFIA is constructed using the best differential characteristic of CLEFIA.And then,based on the distinguisher,an attack against 10-round CLEFIA is proposed.The number of chosen plaintexts required is 2^(119)(or 2^(120)) and the time complexity is 2^(120)(or 2^(121)).Compared with a 7-round impossible Boomerang distinguisher presented by Choy in the 4th International Workshop on Security(IWSEC-2009),the differential characteristics used in the attack are all the best ones,so it is believed that the attack is the best result that the Boomerang attacks can get on CLEFIA at present.