Comparative Analysis of Hashing Algorithms used in Data Deduplication

Authors

  • Selvam JM Dept.of Computer Science, Maruthu pandiyar College of Arts & Science, Thanjavur, Tamilnadu, India
  • Srivaramangai P Dept.of Computer Science, Maruthu pandiyar College of Arts & Science, Thanjavur, Tamilnadu, India

Keywords:

Data Deduplication, Chunking, Hash Function, MD5, SHA-1, SHA-2

Abstract

Now-a-days, increasing volume of digital data demands more storage space and efficient technique to handle these data. Duplicate is inevitable while handling huge amount of data. Data Deduplication is an efficient approach in storage environment that utilize different techniques to deal with duplicate data. It identifies and removes redundant data by its message digest value which is generated by using any kind of cryptographic hash algorithms such as MD5 and Secure hash algorithms. This research paper analyses the two hash algorithms, namely MD5 and SHA, based on different parameters and compare the time taken to build a hash value

References

ean-Sebastien Coron, Yevgeniy Dodis, Cecile Malinaud, and Prashant Puniya, Merkle-Damgard Revisited : how to Construct a Hash Function. CDMP05.pdf.

Wikipedia,http://en.wikipedia.org/wiki / Merkle-Damg% C3% A 5rd _has hash function.

Rivest, R. The MD5 Message-Digest Algorithm", RFC 1321, April 1992.

Aiden Bruen, David Wehlau, Mario Forci --nito, Hash Functions Based on Sylvester Matrices," Patents Oce Kilkenny, September 20th 2001.

D. R. Stinson, Some observations on the theory of cryptographic hash func-tions, University of Waterloo, Canada, March 2, 2001.

Rudiger Weis, Stefan Lucks, Cryptogra-phic Hash Functions, Recent Results on Cryptanalysis and their Implica-tions on System Security," Univeristy of Manheim.

Xiaoyun Wang, Hongbo Yu, How to Break MD5 and Other Hash Functions, Shandong University, Jinan 250100, China

Downloads

Published

2025-11-24

How to Cite

[1]
J. M. Selvam and P. Srivaramangai, “Comparative Analysis of Hashing Algorithms used in Data Deduplication”, Int. J. Comp. Sci. Eng., vol. 7, no. 2, pp. 9–13, Nov. 2025.

Issue

Vol. 7 No. 2 (2019): IJCSE Special Issue Jan Edition

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.