MetadataShow full item record
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.
CitationLopes, R, Franqueira, V, & Hobson, P 2014, 'Efficient computation of hashes', Journal Of Physics: Conference Series, 513, 3, p. 1
PublisherIOP Publishing Ltd
JournalJournal of Physics: Conference Series
Series/Report no.Vol. 513
The following license files are associated with this item: