Optimization of Tree Modes for Parallel Hash Functions : A case study - Laboratoire d'informatique fondamentale de Marseille Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Computers Année : 2017

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

Résumé

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.
Fichier principal
Vignette du fichier
1512.05864v1.pdf (370.8 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01247155 , version 1 (21-12-2015)

Identifiants

Citer

Kevin Atighehchi, Robert Rolland. Optimization of Tree Modes for Parallel Hash Functions : A case study. IEEE Transactions on Computers, 2017, 66 (9), pp.1585-1598. ⟨10.1109/TC.2017.2693185⟩. ⟨hal-01247155⟩
230 Consultations
533 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More