International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3

Authors:
Kevin Atighehchi , Normandie Univ, UNICAEN, ENSICAEN, CNRS, GREYC, 14000 Caen
Alexis Bonnecaze , Aix Marseille Univ, CNRS, Centrale Marseille, I2M, Marseille
Download:
DOI: 10.13154/tosc.v2017.i4.212-239
URL: https://tosc.iacr.org/index.php/ToSC/article/view/809
Search ePrint
Search Google
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.
BibTeX
@article{tosc-2017-28472,
  title={Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3},
  journal={IACR Trans. Symmetric Cryptol.},
  publisher={Ruhr-Universit├Ąt Bochum},
  volume={2017, Issue 4},
  pages={212-239},
  url={https://tosc.iacr.org/index.php/ToSC/article/view/809},
  doi={10.13154/tosc.v2017.i4.212-239},
  author={Kevin Atighehchi and Alexis Bonnecaze},
  year=2017
}