密码学报2016，Vol.3Issue(5)：492-504,13.DOI:10.13868/j.cnki.jcr.000146
对约减轮数Skein-1024的Boomerang区分攻击*
The Boomerang Attacks on Round-Reduced Skein-1024
摘要
Abstract
The hash function Skein is one of the finalists of the NIST SHA-3 competition. At present, many scholars have analyzed the security of this algorithm. Although Skein did not become the final SHA-3 standard, the implementation efficiency and the security of Skein family are nevertheless very good, especially on the aspect of software implementation which is more efficient than the SHA-3 winner Keccak. So there will be some potential application value in some areas for Skein and it is still important to analyze the security of Skein. In this paper, we study the resistance of Skein-1024 against Boomerang attacks. We can attack 33-round, 34-round and 36-round Skein-1024, with a complexity of 2258.34, 2345.52 and 2890 , respectively. The correctness of our attack is verified by a practical 28-round Boomerang quartet. Based on the Boomerang distinguisher, we also propose a related-key key-recovery attack on 39-round simplified (or 32-round normal) Threesh-1024. This attack can recover the 1024 master keys with time, data and memory complexities of 2593.30, 2411 and 245respectively. This is the best Boomerang attack forSkein-1024 known so far.关键词
Boomerang攻击/Skein-1024/Tthreefish/消息修改技术/杂凑算法Key words
Boomerang attack/Skein-1024/Threefish/message modification/Hash function分类
信息技术与安全科学引用本文复制引用
吴广辉,于红波,郝泳霖..对约减轮数Skein-1024的Boomerang区分攻击*[J].密码学报,2016,3(5):492-504,13.基金项目
国家重点基础研究发展计划(973计划)(2013CB834205) （973计划）
国家自然科学基金重点项目(61133013,61373142) （61133013,61373142）
