Enhancing Message Security Through Sha-256 Hash Algorithm
Abstract
This study aims to enhance message security through the implementation of the SHA-256 hash algorithm within the CMC network security context. By employing MATLAB for design and simulation, the research focuses on protecting messages via fragmentation, ensuring encrypted and unencrypted chunks are properly arranged. The objective is to mitigate the impact of malicious attacks, as evidenced by simulations demonstrating the removal of error messages and the clean transmission of data. The research employs the SHA-256 hash algorithm for encrypting messages. The study uses MATLAB to simulate message encryption and decryption processes. The methodology involves: Hashing messages using the SHA-256 algorithm, Fragmenting the hashed messages for transmission, simulating malicious attacks and observing the algorithm's efficacy in error removal and data protection, Ensuring the receiver correctly reassembles and decrypts the fragmented messages. Simulation results show that the SHA-256 algorithm effectively protects messages from various types of malicious attacks. In all tested scenarios, the hashed messages were successfully transmitted, with the receiver able to cleanly receive and reassemble the data. The findings indicate a significant reduction in the vulnerability of messages to external attacks, demonstrating the robustness of the hash-based security system.
References
2. "What are MD2, MD4, and MD5?". Public-Key Cryptography Standards (PKCS): PKCS #7: Cryptographic Message Syntax Standard: 3.6 Other Cryptographic Techniques: 3.6.6 What are MD2, MD4, and MD5?. RSA Laboratories. Retrieved 2011-04-29.
3. Bert den Boer, Antoon Bosselaers (1991). "An Attack on the Last Two Rounds of MD4" (PDF). Archived from the original (PDF) on 2003-05-23.
4. "5.1 Security Considerations for Implementors". Retrieved 2011-07-21. Deriving a key from a password is as specified in [RFC1320] and [FIPS46-2].
5. Ronald L. Rivest Massachusetts Institute of Technology Laboratory for Computer Science NE43-324 545 Technology Square Cambridge
6. Jie Liang and Xuejia Lai Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240.
7. Daemen, J. (1995). Cipher and hash function design strategies based on linear and differential cryptanalysis(Doctoral dissertation, Doctoral Dissertation, March 1995, KU Leuven).
8. S. Al-Kuwari. Engineering Aspects of Hash Functions. In International Conference on Security and Management (SAM '11), 2011.
9. R. P. Arya, “Design and Analysis of a New Hash Algorithm with Key Integration,” vol. 81, no. November, pp. 33–38, 2013.
10. Joux, A. (2004, August). Multicollisions in iterated hash functions. Application to cascaded constructions. In Annual International Cryptology Conference (pp. 306-316). Springer, Berlin, Heidelberg
11. Jane Chan, Low.K.C and Shaung. H, "The Hash Security Implementation", IEEE Trans on Data Communications, Vol. 9, Issue 4, 2017.
12. Ja Shau Kok and Hui Ying, "Introduction to Hash Cryptography System", IEEE Trans on Computer Science and Technology, Vol. 10, Issue 10, 2016.
13. Sandra.L, Maggie. C and Huang Xia, "Advanced Hash Cryptography Encryption", International Journal on Data Communications, Vol. 99, Issue 17, pp. 8 – 23, 2017.
14. Lee Gao Xian and Chong Hua, "Data Encryption using Hashing", International Journal on Data Communications and Computer Sciences, Vol. 90, Issue 19, pp. 29 – 33, 2016.
15. Boysted.M and Kong.C, "Simulation on Data Encryption using Cryptography", International Journal on Data Communications, Vol. 66, No. 10, pp. 56 – 78, 2017.
16. Jeffy.T, Advanced Security in Data Communication, McGraw-Hill, New York, 2014.
17. Chong Wen Tze, Introduction to Data Communication and Encryption, Prentice-Hall, New York, 2015.
18. Deng Tze, Advanced Cryptography and Hashing, Prentice-Hall, New York, 2017.
19. Hao Xian and Jasua. H, Fundamental of Data Encryption, McGraw-Hill, New York, 2016.
20. Osima.M, Practical Encryption and Data Protection, Wiley & Sons, London,
