中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 信息安全国家重点实验室  > 会议论文
题名:
fault propagation pattern based dfa on feistel ciphers, with application to camellia
作者: Chen Haining ; Zhou Yongbin ; Wu Wenling ; Wang Na
会议文集: Proceedings - 10th IEEE International Conference on Computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, ScalCom-2010
会议名称: 10th IEEE International Conference on Computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable Computing and Communications, ScalCom-2010
会议日期: 37436
出版日期: 2010
会议地点: Bradford, United kingdom
关键词: Embedded software ; Embedded systems ; Information technology
出版地: United States
收录类别: EI
ISBN: 9780770000000
部门归属: (1) State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, P. O. Box 8718, Beijing, China
主办者: University of Bradford; IEEE; IEEE Computer Society; IEEE TCSC; IEEE Industry Applications Society (IAS)
英文摘要: This paper presents a systematic Differential Fault Analysis (DFA) method on Feistel ciphers, the outcome of which closely links to that of the theoretical cryptanalysis with provable security. For this purpose, we introduce the notions of Fault Propagation Path (FPPath) and Fault Propagation Pattern (FPPattern). By this method, it can be programmed to automatically compute FPPaths and FPPatterns, which will facilitate the automatic DFA on Feistel ciphers. In this case, the length of FPPath can be regarded as a quantitative metric to evaluate the efficiency of DFA attacks. Moreover, one consequent result of this systematic method is performance enhancement. Specifically, not only the number of attacked rounds but also the number of fault injection points is reduced, which rapidly decrease the amount of required faulty ciphertexts for successful attacks. To verify both the correctness and the efficiency of our method, we perform FPPattern based DFA on Camellia. By making better use of the fundamental property of P-function utilized in Camellia, our attack, without any brute-force search, only requires 6 faulty ciphertexts to retrieve the 128-bit key and 22 faulty ciphertexts to recover 192/256-bit keys, respectively. © 2010 IEEE.
内容类型: 会议论文
URI标识: http://ir.iscas.ac.cn/handle/311060/8762
Appears in Collections:信息安全国家重点实验室_会议论文

Files in This Item:
File Name/ File Size Content Type Version Access License
05578610.pdf(408KB)----限制开放-- 联系获取全文

Recommended Citation:
Chen Haining,Zhou Yongbin,Wu Wenling,et al. fault propagation pattern based dfa on feistel ciphers, with application to camellia[C]. 见:10th IEEE International Conference on Computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable Computing and Communications, ScalCom-2010. Bradford, United kingdom. 37436.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Chen Haining]'s Articles
[Zhou Yongbin]'s Articles
[Wu Wenling]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Chen Haining]‘s Articles
[Zhou Yongbin]‘s Articles
[Wu Wenling]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院软件研究所 - Feedback
Powered by CSpace