Deterministic Differential Properties of the Compression Function of BMW

Jian Guo, Søren Steffen Thomsen

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    1 Downloads (Pure)

    Abstract

    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
    Publication statusPublished - 2011
    Event17th International Workshop on Selected Areas in Cryptography - Waterloo, Canada
    Duration: 12 Aug 201013 Aug 2010
    Conference number: 17

    Workshop

    Workshop17th International Workshop on Selected Areas in Cryptography
    Number17
    CountryCanada
    CityWaterloo
    Period12/08/201013/08/2010
    SeriesLecture Notes in Computer Science

    Keywords

    • Differential
    • Computational complexity
    • Hash function cryptanalysis
    • SHA-3
    • Brute force
    • Blue Midnight Wish

    Fingerprint Dive into the research topics of 'Deterministic Differential Properties of the Compression Function of BMW'. Together they form a unique fingerprint.

    Cite this