In the past few years, there have been significant research advances in the analysis of hash functions and it was shown that none of the hash algorithm is secure enough for critical purposes whether it is MD5 or SHA-1. Nowadays scientists have found weaknesses in a number of hash functions, including MD5, SHA and RIPEMD so the purpose of this paper is combination of some function to reinforce these functions and also increasing hash code length upto 256 that makes stronger algorithm against collision attests.
CITATION STYLE
kumarkasgar, A., agrawal, J., & shahu, S. (2012). New modified 256-bit MD5 Algorithm with SHA Compression Function. International Journal of Computer Applications, 42(12), 47–51. https://doi.org/10.5120/5748-7956
Mendeley helps you to discover research relevant for your work.