Abstract
In the conference PKC’98, Shin et al. proposed a dedicated hash function of the MD family. In this paper, we study the security of Shin’s hash function. We analyze the property of the Boolean functions, the message expansion, and the data dependent rotations of the hash function. We propose a method for finding the collisions of the modified Shin’s hash function and show that we can find collisions with probability 2-30.
Cite
CITATION STYLE
Han, D., Park, S., & Chee, S. (2002). Cryptanalysis of the modified version of the hash function proposed at PKC’98. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2365, pp. 252–262). Springer Verlag. https://doi.org/10.1007/3-540-45661-9_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
