One of the most popular hash algorithms is the SHA-0, proposed by NTST. However, researchers have already found security flaws in SHA-0, thereby also posing a threat against other algorithms of the SHA family. In this paper we present two simple modifications which can be easily incorporated into the original SHA-0 algorithm to make it secure against one of its most basic attack methodologies. We further show that the modified algorithm performs equally well as the original one when compared against standard metrics that are used to evaluate hash functions. We have developed a prototype tool to compare and evaluate the modified and the original SHA-0 algorithm. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Chatterjee, R., Saifee, M. A., & RoyChowdhury, D. (2005). Modifications of SHA-0 to prevent attacks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3803 LNCS, pp. 277–289). https://doi.org/10.1007/11593980_21
Mendeley helps you to discover research relevant for your work.