Pseudo-cryptanalysis of the Original Blue Midnight Wish
Publication: Research - peer-review › Article in proceedings – Annual report year: 2010
The hash function Blue Midnight Wish (BMW) is a candidate in the SHA-3 competition organized by the U.S. National Institute of Standards and Technology (NIST). BMW was selected for the second round of the competition, but the algorithm was tweaked in a number of ways. In this paper we describe cryptanalysis on the original version of BMW, as submitted to the SHA-3 competition in October 2008.
The attacks described are (near-)collision, preimage and second preimage attacks on the BMW compression function. These attacks can also be described as pseudo-attacks on the full hash function, i.e., as attacks in which the adversary is allowed to choose the initial value of the hash function. The complexities of the attacks are about 2^14 for the near-collision attack, about 2^(3n/8+1) for the pseudo-collision attack, and about 2(3n/4+1) for the pseudo-(second) preimage attack, where n is the output length of the hash function. Memory requirements are negligible. Moreover, the attacks are not (or only moderately) affected by the choice of security parameter for BMW.
| Original language | English |
|---|---|
| Title | Fast Software Encryption 2010 |
| Publisher | Springer |
| Publication date | 2010 |
| Pages | 304-317 |
| ISBN (print) | 978-3-642-13857-7 |
| DOIs | |
| State | Published |
Conference
| Conference | Fast Software Encryption 2010 |
|---|---|
| Number | 17 |
| Country | South Korea |
| City | Seoul, Republic of Korea |
| Period | 07-02-10 → 10-02-10 |
| Internet address | http://www.informatik.uni-trier.de/~ley/db/conf/fse/fse2010.html |
| Name | Lecture Notes in Computer Science |
|---|
| Citations | Web of Science® Times Cited: No match on DOI |
|---|
Keywords
- hash function cryptanalysis - SHA-3 competition - Blue Midnight Wish - pseudo-attacks
Loading map data...
ID: 4561010