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

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.