Paper 2016/658

Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3

Kevin Atighehchi and Alexis Bonnecaze


Discussions about the choice of a tree hash mode of operation for a standardization have recently been undertaken. It appears that a single tree mode cannot address adequately all possible uses and specifications of a system. In this paper, we review the tree modes which have been proposed, we discuss their problems and propose remedies. We make the reasonable assumption that communicating systems have different specifications and that software applications are of different types (securing stored content or live-streamed content). Finally, we propose new modes of operation that address the resource usage problem for the three most representative categories of devices and we analyse their asymptotic behavior.

Note: Reduced number of tree modes, with more relevant computational resource trade-offs.

Available format(s)
Publication info
Preprint. MINOR revision.
SHA-3Hash functionsSakuraKeccakSHAKEParallel algorithmsMerkle treesLive streaming
Contact author(s)
kevin atighehchi @ gmail com
2017-08-19: last of 8 revisions
2016-06-28: received
See all versions
Short URL
Creative Commons Attribution


      author = {Kevin Atighehchi and Alexis Bonnecaze},
      title = {Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3},
      howpublished = {Cryptology ePrint Archive, Paper 2016/658},
      year = {2016},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.