Back to personal
page
Blue
Midnight Wish and NIST SHA-3 contest
·
I
am one of
the inventors of Blue Midnight Wish
and one of
the contributors of EDON-R hash functions in this contest. Blue Midnight
Wish passed to the second round, it is the fastest candidate.
NIST Cryptographic Hash Algorithm
Competition:
·
Main page is NIST SHA-3 contest.
Unofficial pages: Zoo, wiki page, list of submitters,
SW performance on eBASH, HW results,
Niels Ferguson comparison.
·
On
Oct. 31, 2008 - deadline for sending proposals.
NIST received 64 entries.
·
On
Dec.10, 2008 NIST accepted 51 First Round Candidates.
·
On
Feb. 25-28, 2009 The
First SHA-3 Candidate Conference was held in Leuven.
·
On
July 24, 2009 NIST selected
the following 14 Second Round Candidates to continue in the competition:
BLAKE, Blue Midnight Wish, CubeHash, ECHO, Fugue, Grøstl, Hamsi, JH, Keccak, Luffa, Shabal, SHAvite-3, SIMD, Skein. Submitters were invited to tweak their submissions by Sept. 15,
2009.
·
On
September 28, 2009 NIST has published
the tweaked versions of the algorithms on their page.
·
Nice
summary of the tweaks is here.
·
NIST
report summarizing the first
round of the competition, and the selection of the second round candidates, is here.
·
Danilo
Gligoroski showed that narrow-pipe
SHA-3 candidates BLAKE, Hamsi,
SHAvite-3 and Skein differ significantly
from ideal random functions
defined over big domains. The paper "Narrow-pipe SHA-3 candidates differ significantly from ideal random functions defined over big domains" is available here. This result is further
elaborated in:
·
Vlastimil
Klima, Danilo Gligoroski: Generic
collision attacks on narrow-pipe hash functions faster than birthday
paradox, applicable to MDx,
SHA-1, SHA-2, and SHA-3 narrow-pipe candidates, IACR eprint, Report 2010/430, pdf.
·
Danilo
Gligoroski, Vlastimil Klima: Practical
consequences of the aberration of narrow-pipe hash designs
from ideal random functions,
IACR eprint, Report 2010/384, pdf.
·
the
Second SHA-3 Candidate
Conference is being
planned for August 23-24,
2010, after Crypto 2010.
Blue Midnight Wish:
·
team homepage
·
Danilo
Gligoroski, Vlastimil Klima, Svein
J. Knapskog, Mohamed El-Hadedy, Jorn Amundsen,
Stig F. Mjolsnes:
Cryptographic Hash Function Blue Midnight Wish, the second version, September 15,
2009, description, reference implementation, the
whole submission package, homepage, differences from the first version
·
Blue Midnight Wish, the first
version, Oct. 2008, description, homepage,
presentation at the First SHA-3 Candidate Conference, Feb. 25-28, 2009,
Cryptanalysis:
·
Søren S. Thomsen: A near-collision attack on the Blue Midnight Wish compression
function, 2008, pdf ver. 2.0,
·
Søren S. Thomsen: Pseudo-cryptanalysis of Blue Midnight
Wish, April 16, 2009, pdf.
·
Danilo
Gligoroski, Vlastimil Klima: On the Computational Asymmetry of the S-boxes Present in Blue Midnight Wish
Cryptographic Hash Function, in Danco Davcev and Jorge
Marx Gomez (eds):
ICT Innovations
2009, Springer, Berlin, Heidelberg, 2010, pp. 391 -
400, Information on ICT Innovations 2009,
Sept. 28 - 30, Ohrid, R. Macedonia,
pdf,
·
Danilo
Gligoroski, Vlastimil Klima, On Blue
Midnight Wish Decomposition, SantaCrypt 2009, Dec. 3-4,
2009, Prague, Czech Republic, Proceedings of SantaCrypt 2009, ISBN
978-80-904257-0-5, pp. 41-51, pdf.
My other
contributions to the SHA-3 contest:
·
Vlastimil
Klima, Danilo Gligoroski: Generic
collision attacks on narrow-pipe hash functions faster than birthday
paradox, applicable to MDx,
SHA-1, SHA-2, and SHA-3 narrow-pipe candidates, IACR eprint, Report 2010/430, pdf.
·
Danilo
Gligoroski, Vlastimil Klima: Practical
consequences of the aberration of narrow-pipe hash designs
from ideal random functions,
IACR eprint, Report 2010/384, pdf.
·
Danilo Gligoroski, Rune Steinsmo Ødegård,
Marija Mihova, Svein Johan Knapskog, Ljupco Kocarev, Ale Drápal, Vlastimil Klima: Cryptographic Hash Function EDON-R,
description,
homepage,
the whole submission package (Jan 12, 2009), presentation at the First SHA-3 Candidate Conference on February 25-28,
2009,
·
Vlastimil Klima: Dynamic SHA is
vulnerable to generic
attacks, letter, Dec. 14, 2008,
·
Vlastimil Klima: Dynamic SHA2 is
vulnerable to generic
attacks, letter, Dec. 14, 2008,
·
Vlastimil Klima: A near-collision attack on BLENDER, letter, official paper, Dec. 19, 2008,
·
Vlastimil Klima: Huge multicollisions
and multipreimages of hash functions BLENDER-n, IACR eprint Report
2009/006, local copy: paper_EN, paper_CZ, Jan. 2, 2009
·
Vlastimil Klima: Multicollisions of EDON-R hash function and
other observations, November 2008, pdf,
·
Vlastimil
Klima and Petr Susil: A Note on Linear Approximations of BLUE MIDNIGHT
WISH Cryptographic Hash Function, Cryptology ePrint
Archive: Report 2009/453,
Sept. 15, 2009