Skip to main content
Kent Academic Repository

Efficient Computation of Hashes

Lopes, Raul H. C., Franqueira, Virginia N. L., Hobson, Peter R. (2014) Efficient Computation of Hashes. Journal of Physics: Conference Series, 513 (3). pp. 1-6. (doi:10.1088/1742-6596/513/3/032042) (KAR id:77189)


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.

Item Type: Article
DOI/Identification number: 10.1088/1742-6596/513/3/032042
Additional information: The paper has been presented at: 20th International Conference on Computing in High Energy and Nuclear Physics (CHEP2013) 14–18 October 2013, Amsterdam, The Netherlands
Uncontrolled keywords: Hashing, Keccak function, NIST SHA-3 competition, parallel implementation, parallel hash trees.
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Virginia Franqueira
Date Deposited: 14 Oct 2019 12:26 UTC
Last Modified: 16 Feb 2021 14:08 UTC
Resource URI: (The current URI for this page, for reference purposes)

University of Kent Author Information

Franqueira, Virginia N. L..

Creator's ORCID:
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.