Paper 2022/248
Collapseability of Tree Hashes
Aldo Gunsing and Bart Mennink
Abstract
One oft-endeavored security property for cryptographic hash functions is collision resistance: it should be computationally infeasible to find distinct inputs
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. PQCrypto 2020
- DOI
- 10.1007/978-3-030-44223-1_28
- Keywords
- collapseabilitycollision resistancetree hashingcomposition
- Contact author(s)
- aldo gunsing @ ru nl
- History
- 2022-03-02: received
- Short URL
- https://ia.cr/2022/248
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/248, author = {Aldo Gunsing and Bart Mennink}, title = {Collapseability of Tree Hashes}, howpublished = {Cryptology {ePrint} Archive, Paper 2022/248}, year = {2022}, doi = {10.1007/978-3-030-44223-1_28}, url = {https://eprint.iacr.org/2022/248} }