Difference between revisions of "Blue Midnight Wish"

From The ECRYPT Hash Function Website
m (Cryptanalysis)
(Pseudo-cryptanalysis of Blue Midnight Wish)
Line 24: Line 24:
 
|-                     
 
|-                     
 
| near-collision || compression || all ||  || example || - || [http://www2.mat.dtu.dk/people/S.Thomsen/bmw/nc-compress.pdf Thomsen]
 
| near-collision || compression || all ||  || example || - || [http://www2.mat.dtu.dk/people/S.Thomsen/bmw/nc-compress.pdf Thomsen]
 +
|-                   
 +
| pseudo-collision || hash || all ||  || 2<sup>3n/8+1</sup>|| - || [http://www.mat.dtu.dk/people/S.Thomsen/bmw/bmw-pseudo.pdf Thomsen]
 +
|-                   
 +
| pseudo-preimage || hash || all ||  || 2<sup>3n/4+1</sup> || - || [http://www.mat.dtu.dk/people/S.Thomsen/bmw/bmw-pseudo.pdf Thomsen]
 
|-                     
 
|-                     
 
|}                     
 
|}                     
Line 37: Line 41:
 
  howpublished = {Version 2.0, available online},
 
  howpublished = {Version 2.0, available online},
 
  year = {2008},
 
  year = {2008},
 +
}
 +
</bibtex>
 +
 +
<bibtex>
 +
@misc{Thomsen-bmw-compress,
 +
author = {Søren S. Thomsen},
 +
title = {Pseudo-cryptanalysis of Blue Midnight Wish},
 +
url = {http://www.mat.dtu.dk/people/S.Thomsen/bmw/bmw-pseudo.pdf},
 +
howpublished = {Available online},
 +
year = {2009},
 +
abstract ={We describe pseudo-collision and pseudo-(second) preimage attacks on the SHA-3 candidate Blue Midnight Wish. The complexity of the pseudo-collision attack is around 2^{3n/8+1}, and the complexity of the pseudo-(second) preimage attack is around 2^{3n/4+1}.},
 
}
 
}
 
</bibtex>
 
</bibtex>

Revision as of 10:46, 16 April 2009

1 The algorithm


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
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 : -
Address :
Date : 2008


2 Cryptanalysis

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

A description of this table is given here.


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
Bibtex
Author : 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

,2009
http://www.mat.dtu.dk/people/S.Thomsen/bmw/bmw-pseudo.pdf
Bibtex
Author : Søren S. Thomsen
Title : Pseudo-cryptanalysis of Blue Midnight Wish
In : -
Address :
Date : 2009