Blue Midnight Wish

From The ECRYPT Hash Function Website

1 The algorithm
2 Cryptanalysis
- 2.1 Hash function
- 2.2 Building blocks

1 The algorithm

Author(s): Danilo Gligoroski, Vlastimil Klima, Svein Johan Knapskog, Mohamed El-Hadedy, Jørn Amundsen, Stig Frode Mjølsnes
Website: http://www.q2s.ntnu.no/sha3_nist_competition/start
NIST submission package:
- round 1: Blue_Midnight_Wish.zip
- round 2: Blue_Midnight_Wish_Round2.zip

Danilo Gligoroski, Vlastimil Klima, Svein Johan Knapskog, Mohamed El-Hadedy, J\orn Amundsen, Stig Frode Mj\olsnes - Cryptographic Hash Function BLUE MIDNIGHT WISH

Submission to NIST (Round 2), 2009

[Electronic Edition] [Bibtex]

Author : Danilo Gligoroski, Vlastimil Klima, Svein Johan Knapskog, Mohamed El-Hadedy, J\orn Amundsen, Stig Frode Mj\olsnes
Title : Cryptographic Hash Function BLUE MIDNIGHT WISH
In : Submission to NIST (Round 2) -

Danilo Gligoroski, Vlastimil Klima - A Document describing all modifications made on the Blue Midnight Wish cryptographic hash function before entering the Second Round of SHA-3 hash competition

Available online, 2009

[Electronic Edition] [Bibtex]

Author : Danilo Gligoroski, Vlastimil Klima
Title : A Document describing all modifications made on the Blue Midnight Wish cryptographic hash function before entering the Second Round of SHA-3 hash competition
In : Available online -

Danilo Gligoroski, Vlastimil Klima, Svein Johan Knapskog, Mohamed El-Hadedy, J\orn Amundsen, Stig Frode Mj\olsnes - Cryptographic Hash Function BLUE MIDNIGHT WISH

Submission to NIST (Round 1), 2008

[Electronic Edition] [Bibtex]

[edit]

2 Cryptanalysis

We distinguish between two cases: results on the complete hash function, and results on underlying building blocks.

A description of the tables is given here.

[edit]

2.1 Hash function

Here we list results on the actual hash function. The only allowed modification is to change the security parameter.

Recommended security parameter: Expandrounds₁ = 2

Type of Analysis	Hash Size (n)	Parameters	Compression Function Calls	Memory Requirements	Reference

[edit]

2.2 Building blocks

Here we list results on underlying building blocks, and the hash function modified by other means than the security parameter.

Note that these results assume more direct control or access over some internal variables (aka. free-start, pseudo, compression function, block cipher, or permutation attacks).

Type of Analysis	Hash Function Part	Hash Size (n)	Parameters/Variants	Compression Function Calls	Memory Requirements	Reference
near-collision	compression	all	(Round 1)	example	-	Thomsen
pseudo-collision	hash	all	(Round 1)	2^3n/8+1	-	Thomsen
pseudo-preimage	hash	all	(Round 1)	2^3n/4+1	-	Thomsen