Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14279/14000
Title: High-throughput implementation of the RIPEMD-160
Authors: Kakarountas, Athanasios P. 
Michail, Harris 
Goutis, Costas E. 
Rjoub, Abdoul M. 
Major Field of Science: Engineering and Technology
Field Category: Electrical Engineering - Electronic Engineering - Information Engineering
Keywords: Security;CMAC;Message authentication code;Secured transactions;VLSI implementation
Issue Date: 1-Dec-2009
Source: International Journal of Internet Technology and Secured Transactions, 2009, vol. 1, no. 3-4, pp. 309-316
Volume: 1
Issue: 3-4
Start page: 309
End page: 316
Journal: International Journal of Internet Technology and Secured Transactions 
Abstract: One-way hash functions are the main cryptographic primitives which are used in the network protocols for user authentication and message integration. In the literature, implementations have been proposed either in hardware or software. The rich number of implementations is expected considering the number of constraints of a target application. When the target is to service more and more users-clients and thus the increase of their throughput, a hardware implementation is dictated. In this paper, RIPEMD-160 hash function is considered and a technique to increase its throughput. This technique involves the application of algorithmic transformations in space and time. The proposed technique leads to an increased throughput by 35% when compared to conventional implementations. Copyright © 2009 Inderscience Enterprises Ltd.
URI: https://hdl.handle.net/20.500.14279/14000
ISSN: 17485703
DOI: 10.1504/IJITST.2009.023910
Rights: © Inderscience
Type: Article
Affiliation : University of Patras 
Jordan University of Science and Technology 
Publication Type: Peer Reviewed
Appears in Collections:Άρθρα/Articles

CORE Recommender
Show full item record

Page view(s)

313
Last Week
0
Last month
2
checked on Nov 6, 2024

Google ScholarTM

Check

Altmetric


Items in KTISIS are protected by copyright, with all rights reserved, unless otherwise indicated.