Welcome to the resource topic for 2013/231
Title:
Sakura: a flexible coding for tree hashing
Authors: Guido Bertoni, Joan Daemen, Michael Peeters, 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.
ePrint: https://eprint.iacr.org/2013/231
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .