Cryptology ePrint Archive: Report 2013/231

Sakura: a flexible coding for tree hashing

Guido Bertoni and Joan Daemen and Michael Peeters and Gilles Van Assche

Abstract: We propose a flexible, fairly general, coding for tree hash modes. The coding does not define a tree hash mode, but instead specifies a way to format the message blocks and chaining values into inputs to the underlying function for any topology, including sequential hashing. The main benefit is to avoid input clashes between different tree growing strategies, even before the hashing modes are defined, and to make the SHA-3 standard tree-hashing ready.

Category / Keywords: applications / tree hashing

Original Publication (with minor differences): 12th International Conference on Applied Cryptography and Network Security (ACNS '14)

Date: received 22 Apr 2013, last revised 18 Apr 2014

Contact author: keccak at noekeon org

Available format(s): PDF | BibTeX Citation

Note: Compared to v1, the only change in the grammar is that inner nodes got extra padding.

Version: 20140418:212215 (All versions of this report)

Short URL: ia.cr/2013/231

Discussion forum: Show discussion | Start new discussion