A precise non-asymptotic complexity analysis of parallel hash functions without tree topology constraints

A recent work shows how we can optimize a tree based mode of operation for a hash function where the sizes of input message blocks and digest are the same, subject to the constraint that the involved tree structure has all its leaves at the same depth. In this work, we show that we can further optim...

Full description

Bibliographic Details

Published in:	Journal of parallel and distributed computing Vol. 137; pp. 246 - 251
Main Author:	Atighehchi, Kevin
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.03.2020 Elsevier
Subjects:	Computer Science Hash functions Merkle trees Parallel algorithms Prefix-free Merkle–Damgård Sponge functions Hash functions Merkle trees Prefix-free Merkle–Damgård Sponge functions Parallel algorithms
ISSN:	0743-7315, 1096-0848
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!