Paper 2006/135
The Design Principle of Hash Function with Merkle-Damgård Construction
Duo Lei, Da Lin, Li Chao, Keqin Feng, and Longjiang Qu
Abstract
The paper discusses the security of
hash function with Merkle-Damgård construction and provides
the complexity bound of finding a collision
and primage of hash function based on the condition probability of
compression function
Note: The paper has not been submited. The result of the paper is different from traditional understading of compression function of hash function. We expect any comment on the paper.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Hash functionsBlock cipherscomplexity theory
- Contact author(s)
- duoduolei @ 163 com
- History
- 2006-05-12: last of 7 revisions
- 2006-04-09: received
- See all versions
- Short URL
- https://ia.cr/2006/135
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2006/135, author = {Duo Lei and Da Lin and Li Chao and Keqin Feng and Longjiang Qu}, title = {The Design Principle of Hash Function with Merkle-Damgård Construction}, howpublished = {Cryptology {ePrint} Archive, Paper 2006/135}, year = {2006}, url = {https://eprint.iacr.org/2006/135} }