Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14279/13968
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Michail, Harris | - |
dc.contributor.author | Goutis, Costas E. | - |
dc.contributor.author | Panagiotakopoulos, George A. | - |
dc.contributor.author | Thanasoulis, Vasilis N. | - |
dc.contributor.author | Kakarountas, Athanasios P. | - |
dc.date.accessioned | 2019-05-31T10:01:26Z | - |
dc.date.available | 2019-05-31T10:01:26Z | - |
dc.date.issued | 2007-04 | - |
dc.identifier.citation | International Journal of Security and Networks, 2007, vol. 2, no. 3-4, pp. 228-238 | en_US |
dc.identifier.issn | 17478405 | - |
dc.description.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 (VPN’s). 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. © 2007 Inderscience Enterprises Ltd. | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartof | International Journal of Security and Networks | en_US |
dc.rights | © Inderscience | en_US |
dc.subject | Hardware implementation | en_US |
dc.subject | Hash functions | en_US |
dc.subject | High-throughput | en_US |
dc.subject | Security | en_US |
dc.title | Server side hashing core exceeding 3 Gbps of throughput | en_US |
dc.type | Article | en_US |
dc.collaboration | University of Patras | en_US |
dc.subject.category | Electrical Engineering - Electronic Engineering - Information Engineering | en_US |
dc.journals | Subscription | en_US |
dc.country | Greece | en_US |
dc.subject.field | Engineering and Technology | en_US |
dc.publication | Peer Reviewed | en_US |
dc.identifier.scopus | 2-s2.0-79951645452 | en |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/79951645452 | en |
dc.contributor.orcid | #NODATA# | en |
dc.contributor.orcid | #NODATA# | en |
dc.contributor.orcid | #NODATA# | en |
dc.contributor.orcid | #NODATA# | en |
dc.contributor.orcid | #NODATA# | en |
dc.relation.issue | 3-4 | en_US |
dc.relation.volume | 2 | en_US |
cut.common.academicyear | 2006-2007 | en_US |
dc.identifier.spage | 228 | en_US |
dc.identifier.epage | 238 | en_US |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.openairetype | article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.journal.journalissn | 1747-8413 | - |
crisitem.journal.publisher | Inderscience Enterprises | - |
crisitem.author.dept | Department of Electrical Engineering, Computer Engineering and Informatics | - |
crisitem.author.faculty | Faculty of Engineering and Technology | - |
crisitem.author.orcid | 0000-0002-8299-8737 | - |
crisitem.author.parentorg | Faculty of Engineering and Technology | - |
Appears in Collections: | Άρθρα/Articles |
CORE Recommender
SCOPUSTM
Citations
50
8
checked on Nov 6, 2023
Page view(s)
295
Last Week
1
1
Last month
1
1
checked on Jan 3, 2025
Google ScholarTM
Check
Items in KTISIS are protected by copyright, with all rights reserved, unless otherwise indicated.