中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
improved results on impossible differential cryptanalysis of reduced-round camellia-192/256

文献类型:期刊论文

作者Liu Ya ; Gu Dawu ; Liu Zhiqiang ; Li Wei
刊名Journal of Systems and Software
出版日期2012
卷号85期号:11页码:2451-2458
ISSN号1641212
英文摘要As an international standard adopted by ISO/IEC, the block cipher Camellia has been used in various cryptographic applications. In this paper, we reevaluate the security of Camellia against impossible differential cryptanalysis. Specifically, we propose several 7-round impossible differentials with the FL/FL-1 layer. Based on one of them, we mount impossible differential attacks on 11-round Camellia-192 and 12-round Camellia-256. The data complexities of our attacks on 11-round Camellia-192 and 12-round Camellia-256 are about 2120 chosen plaintexts and 2119.8 chosen plaintexts, respectively. The corresponding time complexities are approximately 2167.1 11-round encryptions and 2220.87 12-round encryptions. As far as we know, our attacks are 216.9 times and 219.13 times faster than the previously best known ones but have slightly more data. © 2012 Elsevier Inc. All rights reserved.
收录类别EI
语种英语
WOS记录号WOS:000309315500003
公开日期2012-11-12
源URL[http://ir.iscas.ac.cn/handle/311060/14735]  
专题软件研究所_软件所图书馆_期刊论文
推荐引用方式
GB/T 7714
Liu Ya,Gu Dawu,Liu Zhiqiang,et al. improved results on impossible differential cryptanalysis of reduced-round camellia-192/256[J]. Journal of Systems and Software,2012,85(11):2451-2458.
APA Liu Ya,Gu Dawu,Liu Zhiqiang,&Li Wei.(2012).improved results on impossible differential cryptanalysis of reduced-round camellia-192/256.Journal of Systems and Software,85(11),2451-2458.
MLA Liu Ya,et al."improved results on impossible differential cryptanalysis of reduced-round camellia-192/256".Journal of Systems and Software 85.11(2012):2451-2458.

入库方式: OAI收割

来源:软件研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。