Title: 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

Addresses: 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

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.

Keywords: security; hash functions; SHA-1; precomputation; high throughput; hardware implementation; cryptography; networks.

DOI: 10.1504/IJSN.2007.013176

International Journal of Security and Networks, 2007 Vol.2 No.3/4, pp.228 - 238

Published online: 11 Apr 2007 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article