Cryptology ePrint Archive: Report 2016/658

Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3

Kevin Atighehchi and Alexis Bonnecaze

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 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.

Category / Keywords: SHA-3, Hash functions, Sakura, Keccak, SHAKE, Parallel algorithms, Merkle trees, Live streaming

Date: received 27 Jun 2016, last revised 19 Aug 2017

Contact author: kevin atighehchi at gmail com

Available format(s): PDF | BibTeX Citation

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

Version: 20170819:062201 (All versions of this report)

Short URL: ia.cr/2016/658

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]