A bit-slice implementation of the whirlpool hash function

Authors:
Karl Scheibelhofer
Affiliations:
Institute for Applied Information Processing and Communications (IAIK), Graz University of Technology, Graz, Austria
Venue:
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Year:
2007

Citing 6
Cited 0

An Implementation of Bitsliced DES on the Pentium MMXTM Processor

ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
Efficient Rijndael Encryption Implementation with Composite Field Arithmetic

CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
A Fast New DES Implementation in Software

FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
A compact FPGA implementation of the hash function whirlpool

Proceedings of the 2006 ACM/SIGDA 14th international symposium on Field programmable gate arrays
How far can we go on the x64 processors?

FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
Finding collisions in the full SHA-1

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work presents a bit-slice implementation of the Whirlpool hash function for 64-bit CPUs, which processes a single input block in one pass. It describes the general approach for developing the formulas and presents the results. This implementation does not need table lookups that depend on the data, which makes it immune against cache timing attacks, e.g. if used in an HMAC. Moreover, it requires 63% less memory (code and data) than the reference implementation of Whirlpool, and the performance of an implementation in C that uses some SSE2 instructions is only about 40% less. Additional improvements seem possible.