Errata to Sound Hashing Modes of Arbitrary Functions, Permutations, and Block Ciphers

  • Aldo Gunsing Digital Security Group, Radboud University, Nijmegen, The Netherlands
  • Joan Daemen Digital Security Group, Radboud University, Nijmegen, The Netherlands
  • Bart Mennink Digital Security Group, Radboud University, Nijmegen, The Netherlands
Keywords: hash functions, tree hashing, sufficient conditions, indifferentiability, errata

Abstract

In ToSC 2018(4), Daemen et al. performed an in-depth investigation of sound hashing modes based on arbitrary functions, permutations, or block ciphers. However, for the case of invertible primitives, there is a glitch. In this errata, we formally fix this glitch by adding an extra term to the security bound, q/2bn, where q is query complexity, b the width of the permutation or the block size of the block cipher, and n the size of the hash digest. For permutations that are wider than two times the chaining value this term is negligible. For block cipher based hashing modes where the block size is close to the digest size, the term degrades the security significantly.

Published
2020-09-28
How to Cite
Gunsing, A., Daemen, J., & Mennink, B. (2020). Errata to Sound Hashing Modes of Arbitrary Functions, Permutations, and Block Ciphers. IACR Transactions on Symmetric Cryptology, 2020(3), 362-366. https://doi.org/10.13154/tosc.v2020.i3.362-366
Section
Articles