EVOLUTION AND ANALYSIS OF SECURE HASH ALGORITHM (SHA) FAMILY

Main Article Content

Burhan Ul Islam Khan
Rashidah Funke Olanrewaju
Malik Arman Morshidi
Roohie Naaz Mir
Miss Laiha Binti Mat Kiah
Abdul Mobeen Khan

Abstract

With the rapid advancement of technologies and proliferation of intelligent devices, connecting to the internet challenges have grown manifold, such as ensuring communication security and keeping user credentials secret. Data integrity and user privacy have become crucial concerns in any ecosystem of advanced and interconnected communications. Cryptographic hash functions have been extensively employed to ensure data integrity in insecure environments. Hash functions are also combined with digital signatures to offer identity verification mechanisms and non-repudiation services. The federal organization National Institute of Standards and Technology (NIST) established the SHA to provide security and optimal performance over some time. The most well-known hashing standards are SHA-1, SHA-2, and SHA-3. This paper discusses the background of hashing, followed by elaborating on the evolution of the SHA family. The main goal is to present a comparative analysis of these hashing standards and focus on their security strength, performance and limitations against common attacks. The complete assessment was carried out using statistical analysis, performance analysis and extensive fault analysis over a defined test environment. The study outcome showcases the issues of SHA-1 besides exploring the security benefits of all the dominant variants of SHA-2 and SHA-3. The study also concludes that SHA-3 is the best option to mitigate novice intruders while allowing better performance cost-effectively.

Downloads

Download data is not yet available.

Article Details

How to Cite
Khan, B. U. I., Olanrewaju, R. F. ., Morshidi, M. A. ., Mir, R. N. ., Miss Laiha Binti Mat Kiah, & Khan, A. M. . (2022). EVOLUTION AND ANALYSIS OF SECURE HASH ALGORITHM (SHA) FAMILY. Malaysian Journal of Computer Science, 35(3), 179–200. https://doi.org/10.22452/mjcs.vol35no3.1
Section
Articles

Most read articles by the same author(s)