Optimization of Tree Modes for Parallel Hash Functions : A case study

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01247155
Contributor : Robert Rolland <>
Submitted on : Monday, December 21, 2015 - 1:52:19 PM
Last modification on : Monday, March 4, 2019 - 2:04:18 PM
Long-term archiving on : Tuesday, March 22, 2016 - 12:01:53 PM

File

1512.05864v1.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Kevin Atighehchi, Robert Rolland. Optimization of Tree Modes for Parallel Hash Functions : A case study. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2017, 66 (9), pp.1585-1598. ⟨10.1109/TC.2017.2693185⟩. ⟨hal-01247155⟩

Share

Metrics

Record views

366

Files downloads

329