Paper 2013/231 Original: eprint.iacr.org/2013/231 ↗
Sakura: a flexible coding for tree hashing
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)
PDF- Category
- Applications
- Publication info
- Preprint.
- History
- 2014-04-18: last updated
- 2013-04-29: published
- Short URL
- https://ia.cr/2013/231
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2013/231}
}