International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 81 - Issue 1 |
Published: November 2013 |
Authors: Richa Purohit, Upendra Mishra, Abhay Bansal |
![]() |
Richa Purohit, Upendra Mishra, Abhay Bansal . Design and Analysis of a New Hash Algorithm with Key Integration. International Journal of Computer Applications. 81, 1 (November 2013), 33-38. DOI=10.5120/13978-1974
@article{ 10.5120/13978-1974, author = { Richa Purohit,Upendra Mishra,Abhay Bansal }, title = { Design and Analysis of a New Hash Algorithm with Key Integration }, journal = { International Journal of Computer Applications }, year = { 2013 }, volume = { 81 }, number = { 1 }, pages = { 33-38 }, doi = { 10.5120/13978-1974 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2013 %A Richa Purohit %A Upendra Mishra %A Abhay Bansal %T Design and Analysis of a New Hash Algorithm with Key Integration%T %J International Journal of Computer Applications %V 81 %N 1 %P 33-38 %R 10.5120/13978-1974 %I Foundation of Computer Science (FCS), NY, USA
Message Integrity and authenticity are the primary aim with the ever increasing network protocols' speed. Cryptographic Hash Functions are main building block of message integrity. Many types of hash functions are being used and developed. In this paper, we propose and describe a new keyed hash function. This newly designed function produces a hash code of 128 bits for an arbitrary length input. The function also uses a key during hashing, so any intruder that does not know key, cannot forge the hash code, and, thus it fulfills the purpose of security, authentication and integrity for a message in network. The paper discusses the algorithm for the function design, its security aspects and implementation details.