Message Authentication Using New Hash Function
Author(s) -
Hasanen S. Abdulah,
Maha A. Hamood Al-Rawi,
Dalal N. Hammod
Publication year - 2016
Publication title -
journal of al-nahrain university-science
Language(s) - English
Resource type - Journals
eISSN - 2519-0881
pISSN - 1814-5922
DOI - 10.22401/jnus.19.3.20
Subject(s) - hash function , cryptographic hash function , md5 , sha 2 , computer science , hash based message authentication code , hash chain , secure hash algorithm , message authentication code , digital signature , theoretical computer science , authentication (law) , cryptography , computer security
In cryptography, hash functions have very important effects when it’s used in the message integrity, digital time stamping, and digital signature. Hash functions compute hash value by a set of logical (primitive) operations that perform on a (32) bit words for authentication. Authentication process becomes very important especially manipulated message undetected that can have disastrous effects in Network Management and E-Commerce. In this paper, a proposal for new hash function based on MD5 is developed. The length of message digest is 224-bit through (4) rounds that each round has a pair of (16) steps. The final number of steps is (128) that make stronger function against collision attests and more secure than MD5.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom