Open Access iconOpen Access

ARTICLE

A Novel Parallel Computing Confidentiality Scheme Based on Hindmarsh-Rose Model

Jawad Ahmad1,*, Mimonah Al Qathrady2, Mohammed S. Alshehri3, Yazeed Yasin Ghadi4, Mujeeb Ur Rehman5, Syed Aziz Shah6

1 School of Computing, Engineering and the Built Environment, Edinburgh Napier University, Edinburgh, EH10 5DT, UK
2 Department of Information Systems, College of Computer Science and Information Systems, Najran University, Najran, 61441, Saudi Arabia
3 Department of Computer Science, College of Computer Science and Information Systems, Najran University, Najran, 61441, Saudi Arabia
4 Department of Computer Science, Al Ain University, Abu Dhabi, 112612, United Arab Emirates
5 School of Science, Technology and Health, York St John University, York, YO31 7EX, UK
6 Research Centre for Intelligent Healthcare, Coventry University, Coventry, CV1 5FB, UK

* Corresponding Author: Jawad Ahmad. Email: email

Computers, Materials & Continua 2023, 76(2), 1325-1341. https://doi.org/10.32604/cmc.2023.040858

Abstract

Due to the inherent insecure nature of the Internet, it is crucial to ensure the secure transmission of image data over this network. Additionally, given the limitations of computers, it becomes even more important to employ efficient and fast image encryption techniques. While 1D chaotic maps offer a practical approach to real-time image encryption, their limited flexibility and increased vulnerability restrict their practical application. In this research, we have utilized a 3D Hindmarsh-Rose model to construct a secure cryptosystem. The randomness of the chaotic map is assessed through standard analysis. The proposed system enhances security by incorporating an increased number of system parameters and a wide range of chaotic parameters, as well as ensuring a uniform distribution of chaotic signals across the entire value space. Additionally, a fast image encryption technique utilizing the new chaotic system is proposed. The novelty of the approach is confirmed through time complexity analysis. To further strengthen the resistance against cryptanalysis attacks and differential attacks, the SHA-256 algorithm is employed for secure key generation. Experimental results through a number of parameters demonstrate the strong cryptographic performance of the proposed image encryption approach, highlighting its exceptional suitability for secure communication. Moreover, the security of the proposed scheme has been compared with state-of-the-art image encryption schemes, and all comparison metrics indicate the superior performance of the proposed scheme.

Keywords


Cite This Article

APA Style
Ahmad, J., Qathrady, M.A., Alshehri, M.S., Ghadi, Y.Y., Rehman, M.U. et al. (2023). A novel parallel computing confidentiality scheme based on hindmarsh-rose model. Computers, Materials & Continua, 76(2), 1325-1341. https://doi.org/10.32604/cmc.2023.040858
Vancouver Style
Ahmad J, Qathrady MA, Alshehri MS, Ghadi YY, Rehman MU, Shah SA. A novel parallel computing confidentiality scheme based on hindmarsh-rose model. Comput Mater Contin. 2023;76(2):1325-1341 https://doi.org/10.32604/cmc.2023.040858
IEEE Style
J. Ahmad, M.A. Qathrady, M.S. Alshehri, Y.Y. Ghadi, M.U. Rehman, and S.A. Shah "A Novel Parallel Computing Confidentiality Scheme Based on Hindmarsh-Rose Model," Comput. Mater. Contin., vol. 76, no. 2, pp. 1325-1341. 2023. https://doi.org/10.32604/cmc.2023.040858



cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 1032

    View

  • 472

    Download

  • 0

    Like

Share Link