Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3

Authors

  • Kevin Atighehchi Normandy University, University of Caen Normandy (UNICAEN), National Graduate School of Engineering and Research Center (ENSICAEN) , The French National Centre for Scientific Research (CNRS),Groupe de recherche en informatique, image, automatique et instrumentation de Caen (GREYC) , 14000 Caen, France
  • Alexis Bonnecaze Aix-Marseille University, The French National Centre for Scientific Research (CNRS), Centrale Marseille, I2M, Marseille, France

DOI:

https://doi.org/10.13154/tosc.v2017.i4.212-239

Keywords:

SHA-3, Hash functions, Sakura, Keccak, SHAKE, Parallel algorithms, Merkle trees, Live streaming

Abstract

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 solutions. 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 three representative categories of devices and we analyse their asymptotic behavior.

Downloads

Published

2017-12-15

Issue

Volume 2017, Issue 4

Section

Articles

License

Copyright (c) 2017 Kevin Atighehchi, Alexis Bonnecaze

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3. (2017). IACR Transactions on Symmetric Cryptology, 2017(4), 212-239. https://doi.org/10.13154/tosc.v2017.i4.212-239