Paper 2024/407
Permutation-Based Hashing Beyond the Birthday Bound
Abstract
It is known that the sponge construction is tightly indifferentiable from a random oracle up to around
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Published by the IACR in TOSC 2024
- DOI
- 10.46586/tosc.v2024.i1.71-113
- Keywords
- double block length hashingpermutation-based hashingspongelightweight cryptographybeyond birthday bound
- Contact author(s)
-
charlotte lefevre @ ru nl
b mennink @ cs ru nl - History
- 2024-03-08: approved
- 2024-03-06: received
- See all versions
- Short URL
- https://ia.cr/2024/407
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/407, author = {Charlotte Lefevre and Bart Mennink}, title = {Permutation-Based Hashing Beyond the Birthday Bound}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/407}, year = {2024}, doi = {10.46586/tosc.v2024.i1.71-113}, url = {https://eprint.iacr.org/2024/407} }