We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Reseach Article

Secure and Efficient Integrity Algorithm based on Existing SHA Algorithms

by Snigdha Soni, Sandeep Pratap Singh
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 113 - Number 11
Year of Publication: 2015
Authors: Snigdha Soni, Sandeep Pratap Singh
10.5120/19873-1864

Snigdha Soni, Sandeep Pratap Singh . Secure and Efficient Integrity Algorithm based on Existing SHA Algorithms. International Journal of Computer Applications. 113, 11 ( March 2015), 34-37. DOI=10.5120/19873-1864

@article{ 10.5120/19873-1864,
author = { Snigdha Soni, Sandeep Pratap Singh },
title = { Secure and Efficient Integrity Algorithm based on Existing SHA Algorithms },
journal = { International Journal of Computer Applications },
issue_date = { March 2015 },
volume = { 113 },
number = { 11 },
month = { March },
year = { 2015 },
issn = { 0975-8887 },
pages = { 34-37 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume113/number11/19873-1864/ },
doi = { 10.5120/19873-1864 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:50:42.153483+05:30
%A Snigdha Soni
%A Sandeep Pratap Singh
%T Secure and Efficient Integrity Algorithm based on Existing SHA Algorithms
%J International Journal of Computer Applications
%@ 0975-8887
%V 113
%N 11
%P 34-37
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In today's world every person relies on internet for various purposes. There is always a need to take appropriate measures for getting secure communication all the way throughout this unsecure internet. Integrity is one of the most significant factors in the communication scenario. There are various algorithms that ensure the integrity but almost all are either not secure or not efficient. This paper highlights some of such algorithms and also introduces an integrity algorithm and also proves its efficiency with its implementation result.

References
  1. Garbita Gupta and Sanjay Sharma, "Enhanced SHA-192 Algorithm with Larger Bit Difference" IEEE International Conference on Communication Systems and Network Technologies, 2013
  2. L. Thulasimani and M. Madheswaran "Security and Robustness Enhancement of Existing Hash Algorithm" IEEE International Conference on Signal Processing Systems 2009.
  3. A new Hash Function Based on Combination of Existing Digest Algorithms pub 2007.
  4. The Collision Rate Tests of Two Known Message Digest Algorithms 2009.
  5. Harshvardhan Tiwari. A Secure Hash Function MD-192 with Modified Message Expansion" Vol. 7 No. 2 February 2010 International Journal of Computer Science and Information Security.
  6. Marc Stevens hash clash - Framework for MD5 & SHA-1 Differential Path Construction and Chosen-Prefix Collisions for MD5
  7. X. Wang, H. Yu and Y. L. Yin, "Efficient Collision Search Attacks on SHA-0",(Pub 2005)
  8. K. Matusiewicz and J. Pieprzyk, "Finding good differential patterns attacks on SHA-1", (Pub 2004), Available: http://eprint. iacr. org/2004/364. pdf
  9. William Stallings, "Cryptography and Network Security: Principles and Practice. Third edition, Prentice Hall. 2003.
  10. Florent Chabaud, Antoine Joux, "Differential collisions in SHA-0," Advances in Cryptology-CRYPTO'98, LNCS 1462, Springer-Verlag, 1998.
  11. http://en. wikipedia. org/wiki/Secure_Hash_Algorithm
  12. Ricardo Chaves, Georgi Kuzmanov, Leonel Sousa, and Stamatis Vassiliadis " Cost-Efficient SHA Hardware Accelerators" IEEE transactions on very large scale integration (VLSI)Systems, VOL. 16, NO. 8, AUGUST 2008
Index Terms

Computer Science
Information Sciences

Keywords

Computer Security SHA Hash Message Digest