Deterministic Differential Properties of the Compression Function of BMW

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2011

View graph of relations

In this paper, we give some determinstic differential properties for the compression function of SHA-3 candidate Blue Midnight Wish (tweaked version for round 2). The computational complexity is about 20 compression function calls. This applies to security parameters 0/16, 1/15, and 2/14. The efficient differentials can be used to find pseudo-preimages of the compression function with marginal gain over brute force. However, none of these attacks threaten the security of the BMW hash functions.
Original languageEnglish
Title of host publicationSelected Areas in Cryptography 2010 : 17th International Workshop, SAC 2010, Waterloo, Ontario, Canada, August 12-13, Revised Selected Papers
EditorsAlex Biryukov, Guang Gong, Douglas R. Stinson
Volume6544
PublisherSpringer
Publication date2011
Pages338-350
ISBN (print)9783642195730
DOIs
StatePublished

Conference

ConferenceSelected Areas in Cryptography : 17. International Workshop
Number17
CityWaterloo, Ontario, Canada
Period01/01/11 → …
NameLecture Notes in Computer Science
CitationsWeb of Science® Times Cited: No match on DOI

Keywords

  • Differential, Computational complexity, Hash function cryptanalysis, SHA-3, Brute force, Blue Midnight Wish
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 5477861