Wirlwind: a New Cryptographic Hash Function

Paulo Barreto; D. Jungnickel; Ventzislav Nikov; J. Key; S.I. Nikova; P. Wild; Vincent Rijmen; Elmar Tischhouser

doi:10.1007/s10623-010-9391-y

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 journal › Article › Academic › peer-review

35 Citations (Scopus)

434 Downloads (Pure)

Abstract

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 language	Undefined
Pages (from-to)	141-162
Number of pages	22
Journal	Designs, codes and cryptography
Volume	56
Issue number	2-3
DOIs	https://doi.org/10.1007/s10623-010-9391-y
Publication status	Published - 1 Apr 2010

Keywords

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

Access to Document

10.1007/s10623-010-9391-y

Cite this

@article{c36b2d3179844f88ac4f825f3f087931,

title = "Wirlwind: a New Cryptographic Hash Function",

abstract = "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.",

keywords = "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",

author = "Paulo Barreto and D. Jungnickel and Ventzislav Nikov and J. Key and S.I. Nikova and P. Wild and Vincent Rijmen and Elmar Tischhouser",

note = "Open Access ",

year = "2010",

month = apr,

day = "1",

doi = "10.1007/s10623-010-9391-y",

language = "Undefined",

volume = "56",

pages = "141--162",

journal = "Designs, codes and cryptography",

issn = "0925-1022",

publisher = "Springer Netherlands",

number = "2-3",

}

TY - JOUR

T1 - Wirlwind: a New Cryptographic Hash Function

AU - Barreto, Paulo

AU - Nikov, Ventzislav

AU - Nikova, S.I.

AU - Rijmen, Vincent

AU - Tischhouser, Elmar

A2 - Jungnickel, D.

A2 - Key, J.

A2 - Wild, P.

N1 - Open Access

PY - 2010/4/1

Y1 - 2010/4/1

N2 - 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.

AB - 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.

KW - CR-G.2

KW - MSC-94A60

KW - SCS-Cybersecurity

KW - MSC-12E30

KW - Dyadic matrices

KW - Cryptographic hash functions

KW - Normal bases over finite fields

KW - Rebound attacks

KW - EWI-15289

KW - METIS-277390

KW - IR-75134

KW - Whirlpool

U2 - 10.1007/s10623-010-9391-y

DO - 10.1007/s10623-010-9391-y

M3 - Article

SN - 0925-1022

VL - 56

SP - 141

EP - 162

JO - Designs, codes and cryptography

JF - Designs, codes and cryptography

IS - 2-3

ER -