Abstract
In this paper, we give some determinstic differential properties
for the compression function of SHA-3 candidate Blue Midnight
Wish (tweaked version for round 2). The computational complexity is
about 20 compression function calls. This applies to security parameters
0/16, 1/15, and 2/14. The efficient differentials can be used to find
pseudo-preimages of the compression function with marginal gain over
brute force. However, none of these attacks threaten the security of the
BMW hash functions.
Original language | English |
---|---|
Title of host publication | Selected Areas in Cryptography 2010 : 17th International Workshop, SAC 2010, Waterloo, Ontario, Canada, August 12-13, Revised Selected Papers |
Editors | Alex Biryukov, Guang Gong, Douglas R. Stinson |
Volume | 6544 |
Publisher | Springer |
Publication date | 2011 |
Pages | 338-350 |
ISBN (Print) | 9783642195730 |
DOIs | |
Publication status | Published - 2011 |
Event | 17th International Workshop on Selected Areas in Cryptography - Waterloo, Canada Duration: 12 Aug 2010 → 13 Aug 2010 Conference number: 17 |
Workshop
Workshop | 17th International Workshop on Selected Areas in Cryptography |
---|---|
Number | 17 |
Country/Territory | Canada |
City | Waterloo |
Period | 12/08/2010 → 13/08/2010 |
Series | Lecture Notes in Computer Science |
---|
Keywords
- Differential
- Computational complexity
- Hash function cryptanalysis
- SHA-3
- Brute force
- Blue Midnight Wish