Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14279/1745
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Michail, Harris | - |
dc.contributor.author | Yiakoumis, Ioannis I. | - |
dc.contributor.author | Papadonikolakis, Markos E. | - |
dc.date.accessioned | 2013-02-22T14:15:19Z | en |
dc.date.accessioned | 2013-05-17T05:22:33Z | - |
dc.date.accessioned | 2015-12-02T09:54:11Z | - |
dc.date.available | 2013-02-22T14:15:19Z | en |
dc.date.available | 2013-05-17T05:22:33Z | - |
dc.date.available | 2015-12-02T09:54:11Z | - |
dc.date.issued | 2006-03 | - |
dc.identifier.citation | IEEE Potentials, 2006, vol. 25, no. 2, pp. 9-12 | en_US |
dc.identifier.issn | 02786648 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.14279/1745 | - |
dc.description.abstract | A novel design approach for the development of small sized and high speed implementation of the keyed-hash message authentication code (HMAC) is discussed. The design is developed to increase the HMAC throughput to a level that can be used in modern telecommunication application such as virtual private networks (VPN). Hash functions are used to produce a fingerprint of a message or some other block of data that will provide a high level of security for communication protocols. The purpose of HMAC is to authenticate the source of message and its integrity. The use of hash functions can help in reducing the critical path by including the special properties of the hash functions. HMAC offers a significant benefit concerning the maximum achieved operation frequency. As a result, a negligible area penalty was introduced to achieve an increase in throughput up to 390% compared to the competing implementations. | en_US |
dc.format | en_US | |
dc.language.iso | en | en_US |
dc.relation.ispartof | IEEE Potentials | en_US |
dc.rights | © 2006 IEEE | en_US |
dc.subject | Authentication | en_US |
dc.subject | Extranets (Computer networks) | en_US |
dc.subject | Telecommunication systems | en_US |
dc.subject | Virtual reality | en_US |
dc.title | Maximizing the hash function of authentication codes | 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.country | Greece | en_US |
dc.subject.field | Engineering and Technology | en_US |
dc.publication | Peer Reviewed | en_US |
dc.identifier.doi | 10.1109/MP.2006.1649004 | en_US |
dc.dept.handle | 123456789/54 | en |
cut.common.academicyear | 2005-2006 | en_US |
item.grantfulltext | none | - |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.fulltext | No Fulltext | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.openairetype | article | - |
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
13
checked on Nov 9, 2023
Page view(s)
428
Last Week
0
0
Last month
5
5
checked on Dec 23, 2024
Google ScholarTM
Check
Altmetric
Items in KTISIS are protected by copyright, with all rights reserved, unless otherwise indicated.