Name
Abstract | ||
|---|---|---|
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 2(21), 2(16) and 2(216) 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 2(97), 2(52) and 2(452) respectively. |
Year | Venue | Keywords |
|---|---|---|
2010 | CRYPTOLOGY AND NETWORK SECURITY | Hash function, Near-collision, SHA-3 candidates, Skein, BLAKE |
DocType | Volume | ISSN |
Conference | 6467 | 0302-9743 |
Citations | PageRank | References |
14 | 0.94 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bozhan Su | 1 | 48 | 5.24 |
| Wenling Wu | 2 | 787 | 69.06 |
| Shuang Wu | 3 | 66 | 5.52 |
| Le Dong | 4 | 62 | 6.68 |