References
[1] M. Almazrooie, A. Samsudin, A. a. Gutub, M. S. Salleh, M. A. Omar, and S. A. Hassan, "Integrity verification for digital Holy Quran verses using cryptographic hash function and compression," ScienceDirect - Journal of King Saud University – Computer and Information Sciences, vol. 32, 2018.
[2] S. HAKAK, A. KAMSIN, O. TAYAN, M. YAMANI, I. IDRIS, A. GANI, and S. ZERDOUMI, "Preserving Content Integrity of Digital Holy Quran: Survey and Open Challenges," IEEE Access, 2017.
[3] I. Alsmadi and M. Zarour, "Online integrity and authentication checking for Quran electronic versions," Elsevier, 2015.
[4] Reddy, G. Narayana, A. Keerthan, K. Vineetha, and H. Prasad, "Multiple Hashing Using SHA-256 and MD5," in Advances in Computing and Network Communications, ed: Springer, 2021, pp. 643-655.
[5] C. D. Michael, S. Ariel, and MedinaRuji, "Cryptographic randomness test of the modified hashing function of SHA256 to address length extension attack," in Proceedings of the 2020 8th International Conference on Communications and Broadband Networking, 2020, pp. 24-28.
[6] V. K. Sarker, G. T. Nguyen, T. Hannu, and W. Tomi, "Lightweight security algorithms for resource-constrained IoT-based sensor nodes," in ICC 2020-2020 IEEE International Conference on Communications (ICC), 2020, pp. 1-7.
[7] J.-P. Aumasson, CRYPTO DICTIONARY 500 Tasty Tidbits for the Curious Cryptographer, 2021.
[8] D. P. Santos, G. D. Silvestre, and A. Carvalho, "Predictable universally unique identification of sequential events on complex objects," Data & Knowledge Engineering - Elsevier, 2021.
[9] S. Kumar, D. Kumar, and H. S. Lamkuche, "TPA Auditing to Enhance the Privacy and Security in Cloud Systems," Journal of Cyber Security and Mobility, vol. 10 3, pp. 537–568, 25 May 2021.
[10] S. Hakak, A. Kamsin, O. Tayan, M. Y. I. Idris, and G. A. Gilkar, "Approaches for preserving content integrity of sensitive online Arabic content: A survey and research challenges," Elsevier journal, 2017.
[11] N. M. Alaidroos and H. S. Baqtian, "A comparative study between RIPEMD160 and SHA256 hash functions on digital Holy Quran integrity verification," ijsrnsc journal, 2022.
[12] A. Machado and A. Domingues, "Ecological friendly proof-of-work cryptocurrency," Suacoin, 2020.
[13] L. Laouamer and O. Tayan, "An Enhanced SVD Technique for Authentication and Protection of Text-Images using a Case Study on Digital Quran Content with Sensitivity Constraints," Life Science Journal, 2013.
[14] A. M. Hilal, F. AlWesabi, A. Abdelmaboud, M. A. Hamza, M. Mahzari, and A. Hassan, "A Hybrid Intelligent Text Watermarking and Natural Language Processing Approach for Transferring and Receiving an Authentic English Text Via Internet," Computational Intelligence, Machine Learning and Data Analytics The Computer Journal, vol. 00, 7 May 2021.
[15] Rachmawati, Tarigan, and Ginting, "A comparative study of Message Digest 5(MD5) and SHA256 algorithm," presented at the 2nd International Conference on Computing and Applied Informatics, Indonesia, 2017.
[16] S. Long, "A Comparative Analysis of the Application of Hashing Encryption Algorithms for MD5, SHA-1, and SHA-512," ICEMCE, 2019.
[17] H. Shobharam, V. Bhaskar, L. Sapparam, S. Singh, and R. Deepak, "Enhancing the Security and Performance of Cloud for E-Governance Infrastructure: Secure E-MODI," International Journal of Cloud Applications and Computing, 2021.
[18] J. Connor, J. Aumasson, S. Neves, and Z. W. Hearn, "BLAKE3 one function, fast everywhere," https://blake3.io, 2021.
[19] J. M. Biju, N. Gopal, and A. Prakash, "CYBER ATTACKS AND ITS DIFFERENT TYPES," international Research Journal of Engineering and Technology (IRJET), 2019.
[20] H. Yu, G. Wang, G. Zhang, and X. Wang, "The Second-Preimage Attack on MD4," presented at the National Natural Science Foundation of China, China, 2005.
[21] B. Preneel, H. Dobbertin, and A. Bosselaers, "The Cryptographic Hash Function RIPEMD-160," CryptoBytes 1997.
[22] P. Pittalia, "A Comparative Study of Hash Algorithms in Cryptography," International Journal of Computer Science and Mobile Computing IJCSMC, vol. 8, pp. 147 – 152, 2019.