ISCAS OpenIR  > 信息安全国家重点实验室
near-collisions on the reduced-round compression functions of skein and blake
Su Bozhan; Wu Wenling; Wu Shuang; Dong Le
2010
会议名称Cryptology and Network Security 9th International Conference, CANS 2010
会议录名称Cryptology and Network Security
页码124-139
会议日期2010
会议地点Kuala Lumpur Malaysia
部门归属State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, 100190 P.R. China
摘要The SHA-3 competition organized by NIST [1] aims to find a new hash standard as a replacement of SHA-2. Till now, 14 submissions have been selected as the second round candidates, including Skein and BLAKE, both of which have components based on modular addition, rotation and bitwise XOR (ARX). In this paper, we propose improved near-collision attacks on the reduced-round compression functions of Skein and BLAKE. The attacks are based on linear differentials of the modular additions. The computational complexity of near-collision attacks on a 4-round compression function of BLAKE-32, 4-round and 5-round compression functions of BLAKE-64 are 221, 216 and 2216 respectively, and the attacks on 20-round compression functions of Skein-256, Skein-512 and a 24-round compression function of Skein-1024 have a complexity of 297, 252 and 2452 respectively.
关键词Hash Function Near Collision Sha 3 Candidates Skein Blake
内容类型会议论文
URI标识http://ir.iscas.ac.cn/handle/311060/8836
专题信息安全国家重点实验室
推荐引用方式
GB/T 7714
Su Bozhan,Wu Wenling,Wu Shuang,et al. near-collisions on the reduced-round compression functions of skein and blake[C],2010:124-139.
条目包含的文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
near-collisions on t(281KB) 开放获取--请求全文
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Su Bozhan]的文章
[Wu Wenling]的文章
[Wu Shuang]的文章
百度学术
百度学术中相似的文章
[Su Bozhan]的文章
[Wu Wenling]的文章
[Wu Shuang]的文章
必应学术
必应学术中相似的文章
[Su Bozhan]的文章
[Wu Wenling]的文章
[Wu Shuang]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。