Paper 2013/231

Sakura: a flexible coding for tree hashing

Guido Bertoni, Joan Daemen, 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.

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

Metadata
Available format(s)
PDF
Category
Applications
Publication info
Published elsewhere. MINOR revision.12th International Conference on Applied Cryptography and Network Security (ACNS '14)
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
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/231,
      author = {Guido Bertoni and Joan Daemen and Michael Peeters and Gilles Van Assche},
      title = {Sakura: a flexible coding for tree hashing},
      howpublished = {Cryptology ePrint Archive, Paper 2013/231},
      year = {2013},
      note = {\url{https://eprint.iacr.org/2013/231}},
      url = {https://eprint.iacr.org/2013/231}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.