Optimization of Tree Modes for Parallel Hash Functions: A Case Study
From MaRDI portal
Publication:4567201
DOI10.1109/TC.2017.2693185zbMATH Open1390.68754arXiv1512.05864OpenAlexW2586502430MaRDI QIDQ4567201FDOQ4567201
Authors: Kévin Atighehchi, Robert Rolland 
Publication date: 27 June 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/1512.05864
This page was built for publication: Optimization of Tree Modes for Parallel Hash Functions: A Case Study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4567201)
