低轮FOX分组密码的碰撞-积分攻击
文献类型：期刊论文
| 作者 | 吴文玲 ; 卫宏儒 |
| 刊名 | 电子学报
 |
| 出版日期 | 2005 |
| 卷号 | 33期号:7页码:1307-1310 |
| 关键词 | 分组密码 攻击 密钥 计算复杂度 数据复杂度 block cipher attack key data complexity time complexit |
| ISSN号 | 0372-2112 |
| 其他题名 | collision-integral attack of reduced-round fox |
| 中文摘要 | FOX是最近推出的系列分组密码，它的设计思想基于可证安全的研究结果，且在各种平台上的性能优良．本文利用碰撞攻击和积分攻击相结合的技术分析FOX的安全性，结果显示碰撞-积分攻击比积分攻击有效，攻击对4轮FOX64的计算复杂度是2^45.4，对5轮FOX64的计算复杂度是2^109.4，对6轮FOX64的计算复杂度是2^173.4，对7轮FOX64的计算复杂度是2^237.4，且攻击所需数据量均为2^9；也就是说4轮FOX64／64、5轮FOX64／128、6轮FOX64／192和7轮FOX64／256对本文攻击是不免疫的． |
| 收录类别 | ei,cscd,wanfang |
| 语种 | 中文 |
| 公开日期 | 2010-08-20 |
| 附注 | FOX are a family of block ciphers presented recently, which are based upon some results on proven security and have high performances on various platfomis.In this paper, we construct some distinguishers between 3-round FOX and a random permutation of the blocks space. By using collision-searching techniques and integral attack, the distinguishers are used to attack on 4,5, 6 and 7 rounds of FOX64.The four subkeys of 4-round F0X64 can be recovered with 29 chosen plaintexts and 245-4 encryptions.The five subkeys of 5-round FOX64 can be recovered with 29 chosen plaintexts and 2mA encryptions. The six subkeys of 6-round FOX64 can be recovered with 29 chosen plaintexts and 2mA encryptions. The seven subkeys of 7-round FOX64 can be recovered with 29 chosen plaintexts and 22374 encryptions.Therefore,4-round FOX64/64,5-round FOX64/128,6-round FOX64/192 and 7-round FOX64/ 256 are not immune to Collision-Integral attack. |
| 源URL | [http://124.16.136.157/handle/311060/3496]  |
| 专题 | 软件研究所_信息安全国家重点实验室_期刊论文 |
| 推荐引用方式 GB/T 7714 | 吴文玲,卫宏儒. 低轮FOX分组密码的碰撞-积分攻击[J]. 电子学报,2005,33(7):1307-1310. |
| APA | 吴文玲,&卫宏儒.(2005).低轮FOX分组密码的碰撞-积分攻击.电子学报,33(7),1307-1310. |
| MLA | 吴文玲,et al."低轮FOX分组密码的碰撞-积分攻击".电子学报 33.7(2005):1307-1310. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。