| Title: | fault propagation pattern based dfa on feistel ciphers, with application to camellia |
| Author: | Chen Haining
; Zhou Yongbin
; Wu Wenling
; Wang Na
|
| Source: | 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
|
| Conference Name: | 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
|
| Conference Date: | 37436
|
| Issued Date: | 2010
|
| Conference Place: | Bradford, United kingdom
|
| Keyword: | Embedded software
; Embedded systems
; Information technology
|
| Publish Place: | United States
|
| Indexed Type: | EI
|
| ISBN: | 9780770000000
|
| Department: | (1) State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, P. O. Box 8718, Beijing, China
|
| Sponsorship: | University of Bradford; IEEE; IEEE Computer Society; IEEE TCSC; IEEE Industry Applications Society (IAS)
|
| English Abstract: | 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. |
| Content Type: | 会议论文
|
| URI: | http://ir.iscas.ac.cn/handle/311060/8762
|
| Appears in Collections: | 信息安全国家重点实验室_会议论文
|
| 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.
|
|
|
