Whirlwind: a new cryptographic hash function

Authors:
Paulo Barreto;Ventzislav Nikov;Svetla Nikova;Vincent Rijmen;Elmar Tischhauser
Affiliations:
Departamento de Engenharia de Computação e Sistemas Digitais (PCS), Escola Politécnica, Universidade de São Paulo, São Paulo, Brazil;NXP Semiconductors, Leuven, Belgium;EEMCS-DIES, University of Twente, Enschede, The Netherlands and Department of ESAT/SCD-COSIC and IBBT, Katholieke Universiteit Leuven, Louvain, Belgium;Department of ESAT/SCD-COSIC and IBBT, Katholieke Universiteit Leuven, Louvain, Belgium and Institute for Applied Information Processing and Communications (IAIK), Graz University of Technology, G ...;Department of ESAT/SCD-COSIC and IBBT, Katholieke Universiteit Leuven, Louvain, Belgium
Venue:
Designs, Codes and Cryptography
Year:
2010

Citing 9
Cited 1

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Optimal normal bases in GF(pn)

Discrete Applied Mathematics
Differentially uniform mappings for cryptography

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
The Design of Rijndael

The Design of Rijndael
Performance Analysis and Parallel Implementation of Dedicated Hash Functions

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Grøstl

Fast Software Encryption
On the indifferentiability of the sponge construction

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Security of VSH in the real world

INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
VSH, an efficient and provable collision-resistant hash function

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques

Improved impossible differential attacks on large-block rijndael

ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology

Quantified Score

Hi-index	0.00

Visualization

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.