Wirlwind: a New Cryptographic Hash Function

Paulo Barreto, D. Jungnickel (Editor), Ventzislav Nikov, J. Key (Editor), S.I. Nikova, P. Wild (Editor), Vincent Rijmen, Elmar Tischhouser

    Research output: Contribution to journalArticleAcademicpeer-review

    33 Citations (Scopus)
    418 Downloads (Pure)


    A new cryptographic hash function Whirlwind is presented. We give the full specification and explain the design rationale. We show how the hash function can be implemented efficiently in software and give first performance numbers. A detailed analysis of the security against state-of-the-art cryptanalysis methods is also provided. In comparison to the algorithms submitted to the SHA-3 competition, Whirlwind takes recent developments in cryptanalysis into account by design. Even though software performance is not outstanding, it compares favourably with the 512-bit versions of SHA-3 candidates such as LANE or the original CubeHash proposal and is about on par with ECHO and MD6.
    Original languageUndefined
    Pages (from-to)141-162
    Number of pages22
    JournalDesigns, codes and cryptography
    Issue number2-3
    Publication statusPublished - 1 Apr 2010


    • CR-G.2
    • MSC-94A60
    • SCS-Cybersecurity
    • MSC-12E30
    • Dyadic matrices
    • Cryptographic hash functions
    • Normal bases over finite fields
    • Rebound attacks
    • EWI-15289
    • METIS-277390
    • IR-75134
    • Whirlpool

    Cite this