Open Access   Article Go Back

Comparative Analysis of Hashing Algorithms used in Data Deduplication

J. Maria Selvam1 , P. Srivaramangai2

Section:Research Paper, Product Type: Journal Paper
Volume-07 , Issue-02 , Page no. 9-13, Jan-2019

Online published on Jan 31, 2019

Copyright © J. Maria Selvam, P. Srivaramangai . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: J. Maria Selvam, P. Srivaramangai, “Comparative Analysis of Hashing Algorithms used in Data Deduplication,” International Journal of Computer Sciences and Engineering, Vol.07, Issue.02, pp.9-13, 2019.

MLA Style Citation: J. Maria Selvam, P. Srivaramangai "Comparative Analysis of Hashing Algorithms used in Data Deduplication." International Journal of Computer Sciences and Engineering 07.02 (2019): 9-13.

APA Style Citation: J. Maria Selvam, P. Srivaramangai, (2019). Comparative Analysis of Hashing Algorithms used in Data Deduplication. International Journal of Computer Sciences and Engineering, 07(02), 9-13.

BibTex Style Citation:
@article{Selvam_2019,
author = {J. Maria Selvam, P. Srivaramangai},
title = {Comparative Analysis of Hashing Algorithms used in Data Deduplication},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {1 2019},
volume = {07},
Issue = {02},
month = {1},
year = {2019},
issn = {2347-2693},
pages = {9-13},
url = {https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=637},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=637
TI - Comparative Analysis of Hashing Algorithms used in Data Deduplication
T2 - International Journal of Computer Sciences and Engineering
AU - J. Maria Selvam, P. Srivaramangai
PY - 2019
DA - 2019/01/31
PB - IJCSE, Indore, INDIA
SP - 9-13
IS - 02
VL - 07
SN - 2347-2693
ER -

           

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.

Key-Words / Index Term

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

References

[1] Jean-Sebastien Coron, Yevgeniy Dodis, Cecile Malinaud, and Prashant Puniya, Merkle-Damgard Revisited : how to Construct a Hash Function. CDMP05.pdf.
[2] Wikipedia,http://en.wikipedia.org/wiki / Merkle-Damg% C3% A 5rd _has hash function.
[3] Rivest, R. The MD5 Message-Digest Algorithm", RFC 1321, April 1992.
[4] Aiden Bruen, David Wehlau, Mario Forci --nito, Hash Functions Based on Sylvester Matrices," Patents Oce Kilkenny, September 20th 2001.
[5] D. R. Stinson, Some observations on the theory of cryptographic hash func-tions, University of Waterloo, Canada, March 2, 2001.
[6] Rudiger Weis, Stefan Lucks, Cryptogra-phic Hash Functions, Recent Results on Cryptanalysis and their Implica-tions on System Security," Univeristy of Manheim.
[7] Xiaoyun Wang, Hongbo Yu, How to Break MD5 and Other Hash Functions, Shandong University, Jinan 250100, China.