%0 Journal Article
%T Optimization of Tree Modes for Parallel Hash Functions : A case study
%+ Laboratoire d'informatique Fondamentale de Marseille (LIF)
%+ Institut de Mathématiques de Marseille (I2M)
%A Atighehchi, Kevin
%A Rolland, Robert
%< avec comité de lecture
%@ 0018-9340
%J IEEE Transactions on Computers
%I Institute of Electrical and Electronics Engineers
%V 66
%N 9
%P 1585-1598
%8 2017-09-01
%D 2017
%R 10.1109/TC.2017.2693185
%K Hash tree
%K Merkle tree
%K Parallel algorithms
%K Hash functions
%Z Computer Science [cs]Journal articles
%X This paper focuses on parallel hash functions based on tree modes of operation for a compression function. We discuss the various forms of optimality that can be obtained when designing such parallel hash functions. The first result is a scheme which optimizes the tree topology in order to decrease at best the running time. Then, without affecting the optimal running time we show that we can slightly change the corresponding tree topology so as to decrease at best the number of required processors as well. Consequently, the resulting scheme optimizes in the first place the running time and in the second place the number of required processors. The present work is of independent interest if we consider the problem of parallelizing the evaluation of an expression where the operator used is neither associative nor commutative.
%G English
%2 https://hal.science/hal-01247155/document
%2 https://hal.science/hal-01247155/file/1512.05864v1.pdf
%L hal-01247155
%U https://hal.science/hal-01247155
%~ LIF
%~ CNRS
%~ UNIV-AMU
%~ EC-MARSEILLE
%~ I2M
%~ I2M-2014-
%~ LIS-LAB