Institutional Repository
| improved integral attacks on reduced-round clefia block cipher | |
| Li Yanjun; Wu Wenling; Zhang Lei | |
| 2012 | |
| Conference Name | 12th International Workshop on Information Security Applications, WISA 2011 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 28-39 |
| Conference Date | August 22, 2011 - August 24, 2011 |
| Conference Place | Jeju Island, Korea, Republic of |
| Indexed Type | EI |
| ISSN | 0302-9743 |
| ISBN | 9783642278891 |
| Department | (1) State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing 100190 China; (2) Graduate University of Chinese Academy of Sciences Beijing 100049 China; (3) Beijing Electronic Science and Technology Institute Beijing 100070 China |
| English Abstract | In this paper a new 9-round integral distinguisher of CLEFIA is proposed based on byte-pattern, which is proved in detail. Then by using the partial sum technique we improve the previous result on 11-round CLEFIA and proposed integral attack on 12-, 13-and 14-round CLEFIA with the whitening keys. The 12-round CLEFIA-128/192/256 is attacked with data complexity 2113 and time complexity 2116.7, 13-round CLEFIA-192/256 is attacked with data complexity 2113 and time complexity 2180.5, and 14-round CLEFIA-256 is breakable with data complexity 2113 and time complexity 2244.5. These results demonstrate that based on the byte-pattern we can improve the integral attacks on CLEFIA two more rounds than those given by the designers. © 2012 Springer-Verlag Berlin Heidelberg.; In this paper a new 9-round integral distinguisher of CLEFIA is proposed based on byte-pattern, which is proved in detail. Then by using the partial sum technique we improve the previous result on 11-round CLEFIA and proposed integral attack on 12-, 13-and 14-round CLEFIA with the whitening keys. The 12-round CLEFIA-128/192/256 is attacked with data complexity 2113 and time complexity 2116.7, 13-round CLEFIA-192/256 is attacked with data complexity 2113 and time complexity 2180.5, and 14-round CLEFIA-256 is breakable with data complexity 2113 and time complexity 2244.5. These results demonstrate that based on the byte-pattern we can improve the integral attacks on CLEFIA two more rounds than those given by the designers. © 2012 Springer-Verlag Berlin Heidelberg. |
| Keyword | Security Of Data |
| Sponsorship | Ministry of Public Administration and Security (MoPAS); Korea Communications Commission (KCC) |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15689 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Li Yanjun,Wu Wenling,Zhang Lei. improved integral attacks on reduced-round clefia block cipher[C],2012:28-39. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment