Issue No. 09 - Sept. (2017 vol. 66)
Kevin Atighehchi , Aix-Marseille University, CNRS, LIF, Marseille, France
Robert Rolland , Aix-Marseille University, CNRS, I2M, Marseille, France
This paper focuses on parallel hash functions based on tree modes of operation for an inner Variable-Input-Length function. This inner function can be either a single-block-length (SBL) and
prefix-free MD hash function, or a sponge-based hash function. We discuss the various forms of optimality that can be obtained when designing parallel hash functions based on trees where all leaves have the same depth. The first result is a scheme which optimizes the tree topology in order to decrease the running time. Then, without affecting the optimal running time we show that we can slightly change the corresponding tree topology so as to minimize the number of required processors as well. Consequently, the resulting scheme decreases in the first place the running time and in the second place the number of required processors.
Vegetation, Program processors, Topology, Parallel processing, Binary trees, Concrete, Resistance,Hash functions, hash tree, Merkle tree, parallel algorithms
Kevin Atighehchi, Robert Rolland, "Optimization of Tree Modes for Parallel Hash Functions: A Case Study", IEEE Transactions on Computers, vol. 66, no. , pp. 1585-1598, Sept. 2017, doi:10.1109/TC.2017.2693185