International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
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
Download:
DOI: 10.13154/tosc.v2020.i3.362-366
URL: https://tosc.iacr.org/index.php/ToSC/article/view/8706
Search ePrint
Search Google
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/2b−n, 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.
BibTeX
@article{tosc-2020-30574,
  title={Errata to Sound Hashing Modes of Arbitrary Functions, Permutations, and Block Ciphers},
  journal={IACR Transactions on Symmetric Cryptology},
  publisher={Ruhr-Universität Bochum},
  volume={2020, Issue 3},
  pages={362-366},
  url={https://tosc.iacr.org/index.php/ToSC/article/view/8706},
  doi={10.13154/tosc.v2020.i3.362-366},
  author={Aldo Gunsing and Joan Daemen and Bart Mennink},
  year=2020
}