位置:成果数据库 > 期刊 > 期刊详情页
Sandwich-Boomerang attack on reduced round CLEFIA
  • ISSN号:1000-436X
  • 期刊名称:《通信学报》
  • 时间:0
  • 分类:TP393.08[自动化与计算机技术—计算机应用技术;自动化与计算机技术—计算机科学与技术] TS972.1[轻工技术与工程]
  • 作者机构:[1]School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 610054, P. R. China
  • 相关基金: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. 2009AA01 Z422).
中文摘要:

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 2119(or 2120) and the time complexity is 2120(or 2121).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.

英文摘要:

CLEFIA ( named after the French word "Clef" meaning "Key" ) is an efficient, highly secure block cipher proposed by SONY Corporation in the 14th International Workshop on Fast Software En- cryption ( FSE-2007 ) and many cryptanalyses have been used to analyze it. According to the proper- ty of CLEFIA, a new technique Sandwich-Boomerang cryptanalysis is used on it. An 8-round Sand- wich-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 Interna- tional 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.

同期刊论文项目
同项目期刊论文
期刊信息
  • 《通信学报》
  • 中国科技核心期刊
  • 主管单位:中国科学技术协会
  • 主办单位:中国通信学会
  • 主编:杨义先
  • 地址:北京市丰台区成寿寺4路11号邮电出版大厦8层
  • 邮编:100078
  • 邮箱:
  • 电话:010-81055478 81055481
  • 国际标准刊号:ISSN:1000-436X
  • 国内统一刊号:ISSN:11-2102/TN
  • 邮发代号:2-676
  • 获奖情况:
  • 信息产业部通信科技期刊优秀期刊二等奖
  • 国内外数据库收录:
  • 荷兰文摘与引文数据库,美国工程索引,美国剑桥科学文摘,英国科学文摘数据库,日本日本科学技术振兴机构数据库,中国中国科技核心期刊,中国北大核心期刊(2004版),中国北大核心期刊(2008版),中国北大核心期刊(2011版),中国北大核心期刊(2014版),中国北大核心期刊(2000版)
  • 被引量:25019