Efficient computation of hashes

20th International Conference on Computing in High Energy and Nuclear Physics

物理学;计算机科学

Lopes, Raul H. C.^1 ; Franqueira, Virginia N. L.^2 ; Hobson, Peter R.^1

Particle Physics Group, School of Engineering and Design, Brunei University, Uxbridge

UB8 3PH, United Kingdom^1

School of Computing, Engineering and Physical Sciences, University of Central Lancashire, Preston

PR1 2HE, United Kingdom^2

关键词: Distributed storage system;    Efficient computation;    Hash computation;    Parallel Computation;    Parallel implementations;    Security challenges;    Sequential computations;    Service Quality;   

Others  :  https://iopscience.iop.org/article/10.1088/1742-6596/513/3/032042/pdf
DOI  :  10.1088/1742-6596/513/3/032042

学科分类：计算机科学（综合）

来源: IOP

【 摘 要 】

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.