You are looking at a specific version 20130429:111633 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
- Category
- Applications
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- tree hashing
- Contact author(s)
- keccak @ noekeon org
- History
- 2014-04-18: revised
- 2013-04-29: received
- See all versions
- Short URL
- https://ia.cr/2013/231
- License
-
CC BY