Sakura: a flexible coding for tree hashing

DOI10.1007/978-3-319-07536-5_14MaRDI QIDQ5168543zbMATH OpenOpenAlexFDO

Authors Guido Bertoni, Joan Daemen, Michaël Peeters, Gilles Van Assche

Publication date 7 July 2014

Published in Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07536-5_14

zbMATH Keywords

hash functionindifferentiabilitySHA-3tree hashing

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Collapseability of tree hashes
• Compactness of hashing modes and efficiency beyond Merkle tree
• BLAKE2: simpler, smaller, fast as MD5
• Universal hash functions for an infinite universe and hash trees
• Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA?

Cited in

(3)

• Collapseability of tree hashes
• Extending AES improvements: a proposal for alpha-MAC in view of collision resistance
• Open problems in hash function security

This page was built for publication: Sakura: a flexible coding for tree hashing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5168543)