Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14279/1515
DC FieldValueLanguage
dc.contributor.authorMichail, Harris-
dc.contributor.authorKakarountas, Athanasios P.-
dc.contributor.authorGoutis, Costas E.-
dc.contributor.otherΜιχαήλ, Χάρης-
dc.date.accessioned2013-02-22T14:12:17Zen
dc.date.accessioned2013-05-17T05:22:31Z-
dc.date.accessioned2015-12-02T10:07:31Z-
dc.date.available2013-02-22T14:12:17Zen
dc.date.available2013-05-17T05:22:31Z-
dc.date.available2015-12-02T10:07:31Z-
dc.date.issued2005-07-
dc.identifier.citationWSEAS Transactions on Circuits and Systems, 2005, vol. 4, no. 7, pp. 748-755en_US
dc.identifier.issn2224266X-
dc.identifier.urihttps://hdl.handle.net/20.500.14279/1515-
dc.description.abstractMost of internet applications incorporate a security layer in which a hash function is found. These applications are addressing to more and more clients and thus the corresponding server accepts a great number of service requests. In order to indulge these requests the security schemes must have a high-throughput. Furthermore, due to the tendency of the market to minimize devices' size and increase their autonomy to make them portable, power issues have also to be considered as long as the client-side is concerned. In this work the parallelism (or partial unrolling) technique is presented for increasing frequency and throughput of all widely used hash functions - and those that will be used in the future- hash functions such as MD-5, SHA-1, RIPEMD (all versions), SHA-256, SHA-384, and SHA-512 etc. The proposed parallelism technique leads to a 33%- 50% higher throughput comparing to the most competitive implementations and to much lower power dissipation.en_US
dc.formatpdfen_US
dc.language.isoenen_US
dc.relation.ispartofWSEAS Transactions on Circuits and Systemsen_US
dc.rights© WSEASen_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectAlgorithmsen_US
dc.subjectSecurityen_US
dc.subjectField programmable gate arraysen_US
dc.titleNovel technique for high-throughput and power efficient cryptographic primitivesen_US
dc.typeArticleen_US
dc.affiliationUniversity of Patrasen
dc.collaborationUniversity of Patrasen_US
dc.subject.categoryElectrical Engineering - Electronic Engineering - Information Engineeringen_US
dc.journalsOpen Accessen_US
dc.countryGreeceen_US
dc.subject.fieldEngineering and Technologyen_US
dc.publicationPeer Revieweden_US
dc.dept.handle123456789/54en
dc.relation.issue7en_US
dc.relation.volume4en_US
cut.common.academicyear2004-2005en_US
dc.identifier.spage748en_US
dc.identifier.epage755en_US
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.fulltextNo Fulltext-
item.languageiso639-1en-
item.cerifentitytypePublications-
item.openairetypearticle-
crisitem.journal.journalissn2224-266X-
crisitem.journal.publisherWorld Scientific and Engineering Academy and Society-
crisitem.author.deptDepartment of Electrical Engineering, Computer Engineering and Informatics-
crisitem.author.facultyFaculty of Engineering and Technology-
crisitem.author.orcid0000-0002-8299-8737-
crisitem.author.parentorgFaculty of Engineering and Technology-
Appears in Collections:Άρθρα/Articles
CORE Recommender
Show simple item record

Page view(s)

362
Last Week
1
Last month
3
checked on Dec 23, 2024

Google ScholarTM

Check


This item is licensed under a Creative Commons License Creative Commons