Pre-computation technique for optimizing widespread hash functions leading to novel implementations

Authors:
H. E. Michail;A. P. Kakarountas;C. E. Goutis
Affiliations:
Electrical & Computer Engineering Department, University of Patras, Patra, Greece;Electrical & Computer Engineering Department, University of Patras, Patra, Greece;Electrical & Computer Engineering Department, University of Patras, Patra, Greece
Venue:
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
Year:
2005

Citing 2
Cited 0

Implementation of the SHA-2 Hash Family Standard Using FPGAs

The Journal of Supercomputing
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

Hash functions are utilized in the security layer of every communication protocol and in signature authentication schemes for electronic transactions. As time passes more sophisticated applications-that invoke a security layer- arise and address to more users-clients. This means that all these applications demand for higher throughput. In this work a pre-computation technique has been developed for optimizing all frequently used - and those that will be used in the future- hash functions such as MD-5, SHA-1, RIPEMD (all versions), SHA-256, SHA-384, and SHA-512 etc. Comparing to conventional pipelined implementations of hash functions the applied pre-computation technique leads to a 40%-25% higher throughput.