Server side hashing core exceeding 3 Gbps of throughput

Authors:
Harris E. Michail;George A. Panagiotakopoulos;Vasilis N. Thanasoulis;Athanasios P. Kakarountas;Costas E. Goutis
Affiliations:
Department of Electrical and Computer Engineering, University of Patras, GR-26500 Patras, Greece.;Department of Electrical and Computer Engineering, University of Patras, GR-26500 Patras, Greece.;Department of Electrical and Computer Engineering, University of Patras, GR-26500 Patras, Greece.;Department of Electrical and Computer Engineering, University of Patras, GR-26500 Patras, Greece.;Department of Electrical and Computer Engineering, University of Patras, GR-26500 Patras, Greece
Venue:
International Journal of Security and Networks
Year:
2007

Citing 4
Cited 2

Password security: a case history

Communications of the ACM
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
Overview of IEEE 802.16 Security

IEEE Security and Privacy
Finding collisions in the full SHA-1

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

Wireless telemedicine and m-health: technologies, applications and research issues

International Journal of Sensor Networks
A survey of cyber crimes

Security and Communication Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hash functions are forming a special family of cryptographic algorithms, which are applied wherever message integrity and authentication issues are critical. Implementations of these functions are cryptographic primitives to the most widely used cryptographic schemes and security protocols such as Secure Electronic Transactions (SET), Public Key Infrastructure (PKI), IPSec and Virtual Private Networks (VPNs). As time passes it seems that all these applications call for higher throughput due to their rapid acceptance by the market especially to the corresponding servers of these applications. In this work a new technique is presented for increasing frequency and throughput of the currently most used hash function, which is SHA-1. This technique involves the application of spatial and temporal precomputation. Comparing to conventional pipelined implementations of hash functions, the proposed technique leads to an implementation with more than 75% higher throughput.