International Research Journal of Engineering and Technology Volume: 04 Issue: 02 | Feb -2017
(IRJET)
www.irjet.net
e-ISSN: 2395 -0056 p-ISSN: 2395-0072
A REVIEW TOWARDS VARIOUS HASH ALGORITHMS AND THEIR COMPARATIVE ANALYSIS Umesh Gandhi1, Mrs. Poonam Sinha2, Ms. Rachna Kulhare3 2(
1Department
of I.I., UIT, Barkatullah University, Bhopal (M.P.), Inda Professor, Department of Electronics, UIT, Barkatullah University, Bhopal (M.P.), India) 3(Asst. Professor, Department of I.T., UIT, Barkatullah University, Bhopal (M.P.), India)
---------------------------------------------------------------***--------------------------------------------------------------Abstract: Today, with the development of modern technologies, there is always need to upgrade the existing algorithm or replaces to cope up with the latest requirement. Hash algorithms are the one which are used to ensure the integrity of transmitted or stored data. Many of the algorithms have been designed to generate hash in which some were rejected and some were become standard. MD and SHA family are the most popular standard used to generate hash. The aim of this paper is to compare these standard integrity algorithms and also gives a focus of light on the problems they are currently facing.
digested is same as received digest it means no change in the message during transmission process but if digest are not same it means changes happen during transmission process. This change may be cause due to noise or may be done intentionally by intruder. Message
HASH Algorithm
Keywords: Computer Security, SHA, Hash, Message Digest
1. INTRODUCTION
Digest
A cryptographic hash function is an algorithm that generates fixed sized bit string of an arbitrary block of data. This fixed size bit string is a hash value is designed in such a way that if any minor change in the data either accidentally or intentionally, change the hash value with a very high probability. The data to be encoded generally called message and the hash value is called message digest or simply a digest. An ideal hash algorithm must have the following four properties: a.
It should be easy to calculate digest for any given message.
b.
For a given hash, it should be impractical to generate a message.
c.
It should impractical to perform changes in a message without changing hash value.
d.
It should be impractical to search two messages with same digest.
Figure 1 (a) Digest Generation Message
Figure 1 (b) Message preparation for transmission by concatenating message with digest. Message
|
Impact Factor value: 5.181
Digest 1
HASH Algorithm
=
Digest-2 Figure 1 (c) Integrity assurance at receiving end
Cryptographic hash functions attach the digest with the message and transmit to the other end, at the other end the attached digest is separated and the digest of the received message is calculated again. Now, if the recently generated
Š 2017, IRJET
Digest
Figure 1 (a), (b) & (c) shows the above discussed process for the better understanding. Figure 1 (a) shows the
|
ISO 9001:2008 Certified Journal
|
Page 1316