Institutional Repository
| fault analysis study of the block cipher fox64 | |
| Li Ruilin; You Jianxiong; Sun Bing; Li Chao | |
| 2011 | |
| Source | Multimedia Tools and Applications
 |
| ISSN | 1380-7501 |
| Pages | 1-18 |
| English Abstract | FOX is a family of symmetric block ciphers from MediaCrypt AG that helps to secure digital media, communications, and storage. The high-level structure of FOX is the so-called (extended) Lai-Massey scheme. This paper presents a detailed fault analysis of the block cipher FOX64, the 64-bit version of FOX, based on a differential property of two-round Lai-Massey scheme in a fault model. Previous fault attack on FOX64 shows that each round-key (resp. whole round-keys) could be recovered through 11.45 (resp. 183.20) faults on average. Our proposed fault attack, however, can deduce any round-key (except the first one) through 4.25 faults on average (4 in the best case), and retrieve the whole round-keys through 43.31 faults on average (38 in the best case). This implies that the number of needed faults in the fault attack on FOX64 can be significantly reduced. Furthermore, the technique introduced in this paper can be extended to other series of the block cipher family FOX. © 2011 Springer Science+Business Media, LLC.; FOX is a family of symmetric block ciphers from MediaCrypt AG that helps to secure digital media, communications, and storage. The high-level structure of FOX is the so-called (extended) Lai-Massey scheme. This paper presents a detailed fault analysis of the block cipher FOX64, the 64-bit version of FOX, based on a differential property of two-round Lai-Massey scheme in a fault model. Previous fault attack on FOX64 shows that each round-key (resp. whole round-keys) could be recovered through 11.45 (resp. 183.20) faults on average. Our proposed fault attack, however, can deduce any round-key (except the first one) through 4.25 faults on average (4 in the best case), and retrieve the whole round-keys through 43.31 faults on average (38 in the best case). This implies that the number of needed faults in the fault attack on FOX64 can be significantly reduced. Furthermore, the technique introduced in this paper can be extended to other series of the block cipher family FOX. © 2011 Springer Science+Business Media, LLC. |
| Indexed Type | EI |
| Keyword | Digital Storage |
| Department | (1) Department of Mathematics and System Science Science College National University of Defense Technology Changsha 410073 China; (2) State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing 100190 China; (3) College of Computer National University of Defense Technology Changsha 410073 China |
| Language | 英语 |
| WOS ID | WOS:000316483000005 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16069 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Li Ruilin,You Jianxiong,Sun Bing,et al. fault analysis study of the block cipher fox64[J]. Multimedia Tools and Applications,2011:1-18. |
| APA | Li Ruilin,You Jianxiong,Sun Bing,&Li Chao.(2011).fault analysis study of the block cipher fox64.Multimedia Tools and Applications,1-18. |
| MLA | Li Ruilin,et al."fault analysis study of the block cipher fox64".Multimedia Tools and Applications (2011):1-18. |
| 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