Hdl Handle:
http://hdl.handle.net/10545/583881
Title:
Efficient computation of hashes
Authors:
Lopes, Raul ( 0000-0001-9411-863X ) ; Franqueira, Virginia N. L. ( 0000-0003-1332-9115 ) ; Hobson, Peter ( 0000-0002-5645-5253 )
Abstract:
The sequential computation of hashes at the core of many distributed storage systems and found, for example, in grid services can hinder efficiency in service quality and even pose security challenges that can only be addressed by the use of parallel hash tree modes. The main contributions of this paper are, first, the identification of several efficiency and security challenges posed by the use of sequential hash computation based on the Merkle-Damgard engine. In addition, alternatives for the parallel computation of hash trees are discussed, and a prototype for a new parallel implementation of the Keccak function, the SHA-3 winner, is introduced.
Affiliation:
Brunel University; University of Central Lancashire
Citation:
Lopes, R, Franqueira, V, & Hobson, P 2014, 'Efficient computation of hashes', Journal Of Physics: Conference Series, 513, 3, p. 1
Publisher:
IOP Publishing Ltd
Journal:
Journal of Physics: Conference Series
Issue Date:
11-Jun-2014
URI:
http://hdl.handle.net/10545/583881
DOI:
10.1088/1742-6596/513/3/032042
Additional Links:
http://stacks.iop.org/1742-6596/513/i=3/a=032042?key=crossref.5c99c736fc692161992a559122f148cb
Type:
Article
Language:
en
Series/Report no.:
Vol. 513; Track 3
ISSN:
1742-6588; 1742-6596
Appears in Collections:
Department of Electronics, Computing & Maths

Full metadata record

DC FieldValue Language
dc.contributor.authorLopes, Raulen
dc.contributor.authorFranqueira, Virginia N. L.en
dc.contributor.authorHobson, Peteren
dc.date.accessioned2015-12-14T11:02:55Zen
dc.date.available2015-12-14T11:02:55Zen
dc.date.issued2014-06-11en
dc.identifier.citationLopes, R, Franqueira, V, & Hobson, P 2014, 'Efficient computation of hashes', Journal Of Physics: Conference Series, 513, 3, p. 1en
dc.identifier.issn1742-6588en
dc.identifier.issn1742-6596en
dc.identifier.doi10.1088/1742-6596/513/3/032042en
dc.identifier.urihttp://hdl.handle.net/10545/583881en
dc.description.abstractThe sequential computation of hashes at the core of many distributed storage systems and found, for example, in grid services can hinder efficiency in service quality and even pose security challenges that can only be addressed by the use of parallel hash tree modes. The main contributions of this paper are, first, the identification of several efficiency and security challenges posed by the use of sequential hash computation based on the Merkle-Damgard engine. In addition, alternatives for the parallel computation of hash trees are discussed, and a prototype for a new parallel implementation of the Keccak function, the SHA-3 winner, is introduced.en
dc.language.isoenen
dc.publisherIOP Publishing Ltden
dc.relation.ispartofseriesVol. 513en
dc.relation.ispartofseriesTrack 3en
dc.relation.urlhttp://stacks.iop.org/1742-6596/513/i=3/a=032042?key=crossref.5c99c736fc692161992a559122f148cben
dc.rightsArchived with thanks to Journal of Physics: Conference Seriesen
dc.subjectSHA-3en
dc.subjectHashingen
dc.subjectKeccaken
dc.subjectAlgorithmen
dc.titleEfficient computation of hashesen
dc.typeArticleen
dc.contributor.departmentBrunel Universityen
dc.contributor.departmentUniversity of Central Lancashireen
dc.identifier.journalJournal of Physics: Conference Seriesen
This item is licensed under a Creative Commons License
Creative Commons
All Items in UDORA are protected by copyright, with all rights reserved, unless otherwise indicated.