Double graph correlation encryption based on hyperchaos

Preventing unauthorized access to sensitive data has always been one of the main concerns in the field of information security. Accordingly, various solutions have been proposed to meet this requirement, among which encryption can be considered as one of the first and most effective solutions. The continuous increase in the computational power of computers and the rapid development of artificial intelligence techniques have made many previous encryption solutions not secure enough to protect data. Therefore, there is always a need to provide new and more efficient strategies for encrypting information. In this article, a two-way approach for information encryption based on chaos theory is presented. To this end, a new chaos model is first proposed. This model, in addition to having a larger key space and high sensitivity to slight key changes, can demonstrate a higher level of chaotic behavior compared to previous models. In the proposed method, first, the input is converted to a vector of bytes and first diffusion is applied on it. Then, the permutation order of chaotic sequence is used for diffusing bytes of data. In the next step, the chaotic sequence is used for applying second diffusion on confused data. Finally, to further reduce the data correlation, an iterative reversible rule-based model is used to apply final diffusion on data. The performance of the proposed method in encrypting image, text, and audio data was evaluated. The analysis of the test results showed that the proposed encryption strategy can demonstrate a pattern close to a random state by reducing data correlation at least 28.57% compared to previous works. Also, the data encrypted by proposed method, show at least 14.15% and 1.79% increment in terms of MSE and BER, respectively. In addition, key sensitivity of 10−28 and average entropy of 7.9993 in the proposed model, indicate its high resistance to brute-force, statistical, plaintext and differential attacks.