Paper 2008/043 Original: eprint.iacr.org/2008/043 ↗
Cryptanalysis of CRUSH hash structure
Abstract
In this paper, we will present a cryptanalysis of CRUSH hash structure. Surprisingly, our attack could find pre-image for any desired length of internal message. Time complexity of this attack is completely negligible. We will show that the time complexity of finding a pre-image of any length is O(1). In this attack, an adversary could freely find a pre-image with the length of his own choice for any given message digits. We can also find second pre-image, collision, multi-collision in the same complexity with our attack. In this paper, we also introduce a stronger variant of the algorithm, and show that an adversary could still be able to produce collisions for this stronger variant of CRUSH hash structure with a time complexity less than a Birthday attack.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2008-01-29: last updated
- 2008-01-29: published
- Short URL
- https://ia.cr/2008/043
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2008/043,
author = {Nasour Bagheri and Majid Naderi and Babak Sadeghiyan},
title = {Cryptanalysis of CRUSH hash structure},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/043},
year = {2008},
url = {https://eprint.iacr.org/2008/043}
}