ISCAS OpenIR  > 信息安全国家重点实验室
Zodiac算法的不可能差分和积分攻击
孙兵; 张鹏; 李超
2011
Source软件学报
ISSN10009825
Volume22Issue:8Pages:1911-1917
English Abstract重新评估了Zodiac算法抗不可能差分攻击和积分攻击的能力.已有结果显示,Zodiac算法存在15轮不可能差分和8轮积分区分器.首先得到了算法概率为1的8轮截断差分,以此构造了Zodiac算法完整16轮不可能差分和9轮积分区分器.利用9轮积分区分器,对不同轮数Zodiac算法实施了积分攻击,对12轮、13轮、14轮、15轮和16轮Zodiac的攻击复杂度分别为234,259,293,2133和2190次加密运算,选择明文数均不超过216.结果表明,完整16轮192比特密钥的Zodiac算法也是不抗积分攻击的.
AbstractThis paper reevaluates the security of Zodiac against impossible differential and integral attacks. In the past, results have shown that there are 15-round impossible differentials and 8-round integral distinguishers of Zodiac. Based on an 8-round truncated differential, with probability being 1, full 16-round impossible differentials and 9-round integral distinguishers are constructed. Integral attacks are applied to 12/13/14/15/16-round Zodiac with time complexities being 234, 259, 293, 2133 and 2190, respectively. Both the numbers of chosen plaintexts are no more than 216, which shows that the full 16-round Zodiac is not immune to integral attack. © 2011 ISCAS.
KeywordZodiac 不可能差分 截断差分 积分攻击
Department国防科学技术大学理学院数学与系统科学系;中国科学院软件研究所信息安全国家重点实验室
Language中文
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/13983
Collection信息安全国家重点实验室
Recommended Citation
GB/T 7714
孙兵,张鹏,李超. Zodiac算法的不可能差分和积分攻击[J]. 软件学报,2011,22(8):1911-1917.
APA 孙兵,张鹏,&李超.(2011).Zodiac算法的不可能差分和积分攻击.软件学报,22(8),1911-1917.
MLA 孙兵,et al."Zodiac算法的不可能差分和积分攻击".软件学报 22.8(2011):1911-1917.
Files in This Item:
File Name/Size DocType Version Access License
Zodiac算法的不可能差分和积分攻击.(930KB) 开放获取--Application Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[孙兵]'s Articles
[张鹏]'s Articles
[李超]'s Articles
Baidu academic
Similar articles in Baidu academic
[孙兵]'s Articles
[张鹏]'s Articles
[李超]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[孙兵]'s Articles
[张鹏]'s Articles
[李超]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

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