Parallelism technique for speeded-up and low-powered cryptographic primitives

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:
MIV'05 Proceedings of the 5th WSEAS international conference on Multimedia, internet & video technologies
Year:
2005

Citing 3
Cited 0

Comparative Analysis of the Hardware Implementations of Hash Functions SHA-1 and SHA-512

ISC '02 Proceedings of the 5th International Conference on Information Security
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

The main applications of the hash functions are met in the fields of communication integrity and signature authentication. A hash function is utilized in the security layer of every communication protocol. However, as protocols evolve and new high-performance applications appear, the throughput of most hash functions seems to reach to a limit. Furthermore, due to the tendency of the market to minimize devices' size and increase their autonomy to make them portable, power issues have also to be considered. In this work a new technique is presented for increasing frequency and throughput of all widely used hash functions - 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 proposed parallelism technique leads to a 33%-50% higher throughput.