Difference between revisions of "Blue Midnight Wish"
Mschlaeffer (talk | contribs) m |
Mschlaeffer (talk | contribs) m |
||
| Line 51: | Line 51: | ||
Recommended security parameter: Expandrounds<sub>1</sub> = '''2''' | Recommended security parameter: Expandrounds<sub>1</sub> = '''2''' | ||
| + | |||
| + | {| border="1" cellpadding="4" cellspacing="0" class="wikitable" style="text-align:center" | ||
| + | |- style="background:#efefef;" | ||
| + | | Type of Analysis || Hash Size (n) || Parameters || Compression Function Calls || Memory Requirements || Reference | ||
| + | |- | ||
| + | | || || || || || | ||
| + | |- | ||
| + | |} | ||
| + | |||
=== Building blocks === | === Building blocks === | ||
| Line 62: | Line 71: | ||
| Type of Analysis || Hash Function Part || Hash Size (n) || Parameters/Variants || Compression Function Calls || Memory Requirements || Reference | | Type of Analysis || Hash Function Part || Hash Size (n) || Parameters/Variants || Compression Function Calls || Memory Requirements || Reference | ||
|- | |- | ||
| − | | near-collision || compression || all || | + | | near-collision || compression || all || (Round 1) || example || - || [http://www2.mat.dtu.dk/people/S.Thomsen/bmw/nc-compress.pdf Thomsen] |
|- | |- | ||
| − | | pseudo-collision || hash || all || | + | | pseudo-collision || hash || all || (Round 1) || 2<sup>3n/8+1</sup>|| - || [http://www.mat.dtu.dk/people/S.Thomsen/bmw/bmw-pseudo.pdf Thomsen] |
|- | |- | ||
| − | | pseudo-preimage || hash || all || | + | | pseudo-preimage || hash || all || (Round 1) || 2<sup>3n/4+1</sup> || - || [http://www.mat.dtu.dk/people/S.Thomsen/bmw/bmw-pseudo.pdf Thomsen] |
|- | |- | ||
|} | |} | ||
Revision as of 00:09, 30 January 2010
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
- ,2009
- http://people.item.ntnu.no/~danilog/Hash/BMW-SecondRound/Supporting_Documentation/BlueMidnightWishDocumentation.pdf
BibtexAuthor : 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 : -
Address :
Date : 2009
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
- ,2009
- http://people.item.ntnu.no/~danilog/Hash/BMW-SecondRound/Supporting_Documentation/Round2Mods.pdf
BibtexAuthor : 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 : -
Address :
Date : 2009
Danilo Gligoroski, Vlastimil Klima, Svein Johan Knapskog, Mohamed El-Hadedy, J\orn Amundsen, Stig Frode Mj\olsnes - Cryptographic Hash Function BLUE MIDNIGHT WISH
- ,2008
- http://people.item.ntnu.no/~danilog/Hash/BMW/Supporting_Documentation/BlueMidnightWishDocumentation.pdf
BibtexAuthor : 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 : -
Address :
Date : 2008
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.
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: Expandrounds1 = 2
| Type of Analysis | Hash Size (n) | Parameters | Compression Function Calls | Memory Requirements | Reference |
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) | 23n/8+1 | - | Thomsen |
| pseudo-preimage | hash | all | (Round 1) | 23n/4+1 | - | Thomsen |
Søren S. Thomsen - A near-collision attack on the Blue Midnight Wish compression function
- ,2008
- http://www2.mat.dtu.dk/people/S.Thomsen/bmw/nc-compress.pdf
BibtexAuthor : Søren S. Thomsen
Title : A near-collision attack on the Blue Midnight Wish compression function
In : -
Address :
Date : 2008
Søren S. Thomsen - Pseudo-cryptanalysis of Blue Midnight Wish
