Pseudo-cryptanalysis of the Original Blue Midnight Wish

  • Søren S. Thomsen
Conference paper

DOI: 10.1007/978-3-642-13858-4_17

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6147)
Cite this paper as:
Thomsen S.S. (2010) Pseudo-cryptanalysis of the Original Blue Midnight Wish. In: Hong S., Iwata T. (eds) Fast Software Encryption. FSE 2010. Lecture Notes in Computer Science, vol 6147. Springer, Berlin, Heidelberg

Abstract

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 214 for the near-collision attack, about 23n/8 + 1 for the pseudo-collision attack, and about 23n/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.

Keywords

hash function cryptanalysis SHA-3 competition Blue Midnight Wish pseudo-attacks 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Søren S. Thomsen
    • 1
  1. 1.DTU MathematicsTechnical University of Denmark 

Personalised recommendations