Chaos, Solitons and Fractals 170 (2023) 113396

Contents lists available at ScienceDirect

Chaos, Solitons and Fractals

journal homepage: www.elsevier.com/locate/chaos

Image encryption based on 8D hyperchaotic system using Fibonacci Q-Matrix

Geeta Biban, Renu Chugh, Anju Panwar ∗
Department of Mathematics, Maharshi Dayanand University, Rohtak, 124001, India

ARTICLE INFO ABSTRACT

Keywords: One of the key tenets of the enormous and still-expanding digital realm is the security of images. In recent
Hyperchaotic system years, the interest in image encryption has increased among researchers. This paper proposes an image
Fibonacci Q-Matrix encryption scheme using an 8D hyperchaotic system with Fibonacci Q-Matrix (FQ-matrix). The strength of
Encryption
the proposed image encryption algorithm is estimated by checking the statistical attacks (Histogram analysis,
Statistical attacks
correlation coefficient, and information entropy) and differential attacks (NPCR, UACI).
Differential attacks

1. Introduction method using a random matrix transform and 5D hyperchaotic system.

Gong et al. [15] used a discrete fractional random transform and hy-
In 1970, chaos theory was established and its intrinsic properties, perchaotic system to encrypt and compress images. For further related
such as randomness, unpredictability, sensitivity to the initial con- work or similar topics, see [16–24].
ditions, and control parameters satisfy the essential prerequisites of The objective of this research paper is to generate a more protective
cryptography. Therefore, chaotic systems are appropriate for image encryption algorithm for gray images. The proposed image encryption
encryption. The chaotic systems can be classified into two categories: and decryption scheme are used in public impart applications to secure
low-dimensional systems such as one-dimensional chaotic maps and confidential image data against assailants. Image encryption algorithms
high-dimensional systems such as hyperchaotic maps. Low-dimensional generally follow two key steps: confusion and diffusion. In this paper,
systems are simple to implement and they have a smaller keyspace we choose an 8d hyperchaotic system to scramble the pixels of the
that provided low security. In comparison to low-dimensional systems, images because hyperchaotic systems are providing a more secure
hyperchaotic systems produce key sequences with a large keyspace and encryption algorithm. In the diffusion step, we change the gray value
provided high security. of the pixels using a 2 × 2 FQ-matrix.
In [1], Matthews introduced the first chaos-based image encryption The main contributions of this research work are described as
scheme. Wang et al. [2] generated an image encryption approach follows.
that depends on a chaotic system of color images. Pareek et al. [3]
• We generated a new cryptographic algorithm that is based on a 8d
designed an image encryption algorithm using the chaotic logistic hyperchaotic system and FQ-matrix for encrypting and decrypting
map. Khaitan et al. [4] proposed a symmetric key image encryption gray images.
scheme based on a 3D logistic map. Hosny et al. [5] introduced a
• The algorithm applies various 256 by 256 gray images like
new image encryption scheme using FQ-matrix and a hyperchaotic
‘‘Lena’’, ‘‘Baboon’’, ‘‘Pepper’’, and ‘‘Airplane’’.
system. Subsequently, 4D hyperchaotic Chen’s system encrypts color
• To check the distribution of the gray value in original, encrypted,
images [6]. Hosny et al. [7] also generated image encryption techniques
and decrypted images, we use histogram analysis.
using a logistic map and block scrambling process. Subsequently, 2D
• To evaluate the correlation between two adjacent pixels in the
logistic sine map and fractional shifted Gegenbauer moments are used
original images or encrypted images. We analyze the correla-
for encrypting color images in [8]. Hua et al. [9] framed out the
tion coefficient value and also compare it with other existing
image encryption model using a cosine transform based chaotic system.
algorithms.
Li et al. [10] used a one-dimensional chaotic tent map for image
• To validate how secure the proposed algorithm, we use entropy
encryption. In [11], Wu et al. presented an image encryption scheme
analysis and also compare it with other encrypted algorithms.
2D Henon map. Enayatifar et al. [12] encrypt the images using a
• To analyze how secure the generated encryption algorithm against
synchronous permutation diffusion process. Niyat et al. [13] framed the
cyber criminals, we experiment with differential attacks on differ-
model for encrypting the images using cellular automata and a hybrid
ent images.
hyperchaotic system. Sheela et al. [14] generated an image encryption

∗ Corresponding author.
E-mail addresses: [email protected] (G. Biban), [email protected] (R. Chugh), [email protected] (A. Panwar).

https://doi.org/10.1016/j.chaos.2023.113396
Received 28 November 2022; Received in revised form 15 March 2023; Accepted 20 March 2023
Available online 27 March 2023
0960-0779/© 2023 Published by Elsevier Ltd.
G. Biban et al. Chaos, Solitons and Fractals: the interdisciplinary journal of Nonlinear Science, and Nonequilibrium and Complex Phenomena 170 (2023) 113396

Fig. 1. MATLAB 2D and 3D phase plots of the 8D hyperchaotic system for 𝑋(0) = (1, 1, 1, 1, 0, 0, 0, 0) and (𝜏1 , 𝜏2 , 𝜏3 , 𝜏4 , 𝜏5 , 𝜏6 , 𝜏7 ) = (10, 76, 3, 0.2, 0.1, 0.1, 0.2).

In Section 2, Preliminaries contains the mathematical fundamentals system. Fig. 2 represents the system has six positive Lyapunov expo-
of the 8D hyperchaotic map and FQ-matrix. The algorithm for encrypt- nents which indicate that the system is hyperchaotic.
ing and decrypting an image are in Section 3. Experimental results show
the encrypted and decrypted images based on the proposed algorithms 2.2. Fibonacci Q-Matrix [26]
in Section 4. Statistical analysis like histogram, correlation coefficient,
and entropy analysis is described in Section 5. Section 6 contains the
The elements of the Fibonacci sequence 𝐹𝑛 are
differential attacks. At last, this paper is concluded in Section 7.
𝐹𝑛 = 𝐹𝑛−1 + 𝐹𝑛−2 ; 𝑛 > 1,
2. Preliminaries
where 𝐹1 = 𝐹2 = 1. The FQ-matrix is given by:
[ ] [ ]
2.1. 8D hyperchaotic system [25] 𝐹 𝐹1 1 1
𝑄= 2 = ,
𝐹1 𝐹0 1 0
Let 𝑋 = (𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 , 𝑥5 , 𝑥6 , 𝑥7 , 𝑥8 ) denotes the state of the 8D
where 𝐹𝑛 is a Fibonacci number and |𝑄| = −1. Then
hyperchaotic system.
[ ]
⎧ 𝐹 𝐹𝑛
𝑄𝑛 = 𝑛+1 ,
⎪𝑥̇1 = 𝜏1 (𝑥2 − 𝑥1 ) + 𝑥4 ; 𝐹𝑛 𝐹𝑛−1
⎪𝑥̇ = 𝜏2 𝑥1 − 𝑥1 𝑥3 + 𝑥4 ;
⎪ 2
⎪𝑥̇3 |𝑄𝑛 | = 𝐹𝑛+1 𝐹𝑛−1 − 𝐹𝑛2 = (−1)𝑛 ,
= 𝑥1 𝑥2 − 𝑥3 − 𝑥4 + 𝑥7 ;
⎪
⎪𝑥̇4 = −𝜏3 (𝑥1 + 𝑥2 ) + 𝑥5 ; [ ]
⎨ (1) 𝐹𝑛−1 −𝐹𝑛
= −𝑥2 − 𝜏4 𝑥4 + 𝑥6 ; 𝑄−𝑛 = .
⎪𝑥̇5 −𝐹𝑛 𝐹𝑛+1
⎪𝑥̇ = −𝜏5 (𝑥1 + 𝑥5 ) + 𝜏4 𝑥7 ;
⎪ 6
⎪𝑥̇7 = −𝜏6 (𝑥1 + 𝑥6 − 𝑥8 ); 3. Algorithm
⎪
⎪𝑥̇8 = −𝜏7 𝑥7 ,
⎩ 3.1. Encryption process
where (𝜏1 , 𝜏2 , 𝜏3 , 𝜏4 , 𝜏5 , 𝜏6 , 𝜏7 ) are the seven constant parameters deter-
mining the chaotic, hyperchaotic, periodic behaviors, and bifurcations Image encryption algorithm are based on two key steps. Confusion
of the system. The system exhibits hyperchaotic behavior when 𝑋(0) = is the first step, in which the 8D hyperchaotic system changes the pixel
(1, 1, 1, 1, 0, 0, 0, 0) and (𝜏1 , 𝜏2 , 𝜏3 , 𝜏4 , 𝜏5 , 𝜏6 , 𝜏7 ) = (10, 76, 3, 0.2, 0.1, 0.1, 0.2). arrangements. The second step is diffusion, in which the FQ-matrix
The 8D hyperchaotic system has eight Lyapunov exponents (𝐿𝐸 ′ ) are : changes the value of pixels.
𝐿𝐸1′ = 1.4565, 𝐿𝐸2′ = 0.1176, 𝐿𝐸3′ = 0.0623, Step 1: Given plain image 𝐷 with size 𝑀 × 𝑁 and convert image 𝐷 to
𝐿𝐸4′ = 0.0433, 𝐿𝐸5′ = 0.0260, 𝐿𝐸6′ = 0.0132, vector 𝑆.
𝐿𝐸7′ = 0 and 𝐿𝐸8′ = −12.6987. Step 2: The confusion stage depends on the 8D hyperchaotic map. We
determine the initial key of the hyperchaotic system using
Fig. 1 shows the 2D and 3D phase plots of the 8D hyperchaotic system
∑𝑀𝑁
at 𝑋(0) = (1, 1, 1, 1, 0, 0, 0, 0) and (𝜏1 , 𝜏2 , 𝜏3 , 𝜏4 , 𝜏5 , 𝜏6 , 𝜏7 ) = (10, 76, 3, 0.2, 𝑆(𝑖) + (𝑀 × 𝑁)
0.1, 0.1, 0.2) for better understanding the nature of the 8D hyperchaotic 𝑥(1) = 𝑖=1 ,
223 + (𝑀 × 𝑁)

2
G. Biban et al. Chaos, Solitons and Fractals: the interdisciplinary journal of Nonlinear Science, and Nonequilibrium and Complex Phenomena 170 (2023) 113396

Fig. 2. LE’s of the 8D hyperchaotic system for 𝑋(0) = (1, 1, 1, 1, 0, 0, 0, 0) and (𝜏1 , 𝜏2 , 𝜏3 , 𝜏4 , 𝜏5 , 𝜏6 , 𝜏7 ) = (10, 76, 3, 0.2, 0.1, 0.1, 0.2).

Fig. 3. Proposed methodology.

and other initials computed by − 𝑥(2) − 𝜏(4) ∗ 𝑥(4) + 𝑥(6)

for 𝑖 = 2 ∶ 8 − 𝜏(5) ∗ (𝑥(1) + 𝑥(5)) + 𝜏(4) ∗ 𝑥(7)
𝑥(𝑖) = 𝑚𝑜𝑑(𝑥(𝑖 − 1) ∗ 1𝑒8, 1) − 𝜏(6) ∗ (𝑥(1) + 𝑥(6) − 𝑥(8))
end − 𝜏(7) ∗ 𝑥(7)]’’
Where 1𝑒8 = 1 ∗ 108 . Which is based on the plain image.
and select three sequences (𝑥(1), 𝑥(2), 𝑥(5))𝐾. The sequence 𝐾 has size
Step 3: Generate the 8D hyperchaotic system and using this system, we 𝑀 × 𝑁.
obtained a new vector 𝐾 using pseudocode:
Step 4: Obtain the vector 𝐿 by shorting the sequence 𝐾 in ascending
‘‘𝜏(1) = 10; 𝜏(2) = 76; 𝜏(3) = 3; 𝜏(4) = 0.2; order for the three components 𝑥(1), 𝑥(2), and 𝑥(5). We calculate the
𝜏(5) = 0.1; 𝜏(6) = 0.1; 𝜏(7) = 0.2; permuted vector 𝑃 = 𝑆(𝐿𝑖 ) depending on the sequence 𝐾. For compute
the vector 𝐿, and 𝑃 we use pseudocode
𝐾 = @(𝑡, 𝑥(1))[𝜏(1) ∗ (𝑥(2) − 𝑥(1)) + 𝑥(4)
𝜏(2) ∗ 𝑥(1) − 𝑥(1) ∗ 𝑥(3) + 𝑥(4) ‘‘𝐾 = 𝑌 (1 ∶ 𝑀𝑁, 1 ∶ 2 ∶ 5);

𝑥(1) ∗ 𝑥(2) − 𝑥(3) − 𝑥(4) + 𝑥(7) [𝐾2, 𝐿] = 𝑠𝑜𝑟𝑡(𝐾);

− 𝜏(3) ∗ (𝑥(1) + 𝑥(2)) + 𝑥(5) 𝑃 = 𝑆(𝐿); ’’

3
G. Biban et al. Chaos, Solitons and Fractals: the interdisciplinary journal of Nonlinear Science, and Nonequilibrium and Complex Phenomena 170 (2023) 113396

Fig. 4. (a) Plain image (b) Encrypted image (c) Decrypted image.

Where 𝑌 is the solution array of the 8D hyperchaotic system using 3.2. Decryption process
MATLAB function ode45.
In this section, the reverse procedure of encryption is carried out.
Step 5: The diffusion step depends on FQ-matrix. In this disordered
We use the 8D hyperchaotic map to implement the decryption process.
image, 𝑃 is convert into 𝑀 × 𝑁 matrix and is separated into subblocks
of size 2 × 2. Step 1: Read cipher image 𝐶 and separate it into subblocks of size 2×2.
We use the following diffusion equation with 𝑄−10 on image blocks to
Step 6: Using FQ-matrix multiply each subblock with 𝑄10 matrix then
obtain scrambled image 𝐾 ′ .
get matrix 𝐶 and plain image 𝐷 = 𝐶. Get the output in cipher image or [ ]
′
𝐾𝑚,𝑛 ′
𝐾𝑚,𝑛+1
encrypted image in the form 𝐶. The proposed methodology to encrypt
′ ′ =
an image is given in Fig. 3. 𝐾𝑚+1,𝑛 𝐾𝑚+1,𝑛+1

4
G. Biban et al. Chaos, Solitons and Fractals: the interdisciplinary journal of Nonlinear Science, and Nonequilibrium and Complex Phenomena 170 (2023) 113396

Fig. 5. Histogram analysis corresponding to (a) Plain image (b) Encrypted image (c) Decrypted image according to Fig. 4.

[ ][ ]
𝐶𝑚,𝑛 𝐶𝑚,𝑛+1 34 −55
𝑚𝑜𝑑 256,
𝐶𝑚+1,𝑛 𝐶𝑚+1,𝑛+1 −55 89
Step 4: Convert 𝑄 into matrix 𝐹 and 𝐶 = 𝐷 and get the decrypted
where 𝑚 = 1 ∶ 3 ∶ 5 ∶ ... ∶ 𝑀, and 𝑛 = 1 ∶ 3 ∶ 5 ∶ ... ∶ 𝑁. image 𝐷.
Step 2: Convert image 𝐾 ′ into vector 𝑊 .
4. Experimental results
Step 3: The vector 𝐿 generated in the encryption procedure is used to
restore each pixel back to its original place by the following equation:
Different gray images, such as ‘‘Lena’’, ‘‘Baboon’’, ‘‘Peppers’’, and
𝑄(𝐿𝑚 ) = 𝑊𝑚 ; 𝑚 = 1 ∶ 𝑀𝑁. ‘‘Airplane’’ with size 256 × 256 were used for research. Fig. 4 shows

5
G. Biban et al. Chaos, Solitons and Fractals: the interdisciplinary journal of Nonlinear Science, and Nonequilibrium and Complex Phenomena 170 (2023) 113396

Fig. 6. Correlation analysis (a) Lena plain image (b) Lena encrypted image.

the results of encryption and decryption images. We have used Mat- 5. Statistical analysis
lab 9.10.0 (R2021a) to run the proposed encryption and decryption
algorithm in a computer including an Intel (R) Core i5 CPU 1.60 GHz, Numerous tests have been conducted to demonstrate the algo-
256 GB SSD, and 1 TB hard-disk capacity, and the operating system is rithm’s resistance to statistical attacks, including histogram, correlation
Microsoft Windows 11 version 21 H2. coefficient, and entropy analysis.

4.1. Keyspace 5.1. Histogram analysis

The proposed image encryption algorithm has various security key:

Histogram analysis is used to determine the statistical similarities
𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 , 𝑥5 , 𝑥7 , 𝑥8 , 𝜏1 , 𝜏2 , 𝜏3 , 𝜏4 , 𝜏5 , 𝜏6 , and 𝜏7 . The encryption and de-
between the original image and the encrypted image. The original
cryption algorithm proposed in this research paper contains a 128-bit
image histogram represents the random distribution of pixels, but the
secret key, so the algorithm has 2128 large key space.
histogram of an encrypted image shows the uniform distribution of
pixels, proving that the proposed algorithm is secure enough against
4.2. Time complexity
statistical attacks. Fig. 5 shows that the proposed algorithm is secured
from statistical attacks.
The time complexity of an algorithm is not the real-time required
to deploy a specific program, but the number of times a statement
accomplishes. For the proposed image encryption algorithm, the time 5.2. Correlation coefficient analysis
complexity for the confusion step is 𝑂(𝑀 × 𝑁), and for FQ-matrix the
time complexity is 𝑂(𝑃𝑚𝑎𝑥 × 𝑄𝑚𝑎𝑥 × 𝑀 × 𝑁), where 𝑃𝑚𝑎𝑥 = 2, 𝑄𝑚𝑎𝑥 = 2. The correlation coefficient is the measure of the correlation between
With compare to [7,8] the confusion step of the existing encryption two adjacent pixels. The correlation coefficient of each pair of pixels
algorithm takes 𝑂(𝑀 × 𝑁 × 3) time complexity. In [8] for generating can be calculated as:
matrix, the time complexity is 𝑂(𝑃𝑚𝑎𝑥 × 𝑄𝑚𝑎𝑥 × 𝑀 × 𝑁), where 𝑃𝑚𝑎𝑥 = 𝐸[(𝑡 − 𝐸(𝑡))(𝑠 − 𝐸(𝑠))]
𝑀 𝑁 𝑟𝑠,𝑡 = √ √ ,
32
, 𝑄𝑚𝑎𝑥 = 32 . 𝐷(𝑡) × 𝐷(𝑠)

6
G. Biban et al. Chaos, Solitons and Fractals: the interdisciplinary journal of Nonlinear Science, and Nonequilibrium and Complex Phenomena 170 (2023) 113396

Fig. 7. Correlation analysis (a) Baboon plain image (b) Baboon encrypted image.

correlation coefficient values are equal to zero in a statistical manner

1 ∑
𝑇
𝐸(𝑠) = 𝑠, for the proposed algorithm.
𝑇 𝑖=1 𝑖

1 ∑
𝑇 5.3. Entropy analysis
𝐷(𝑠) = (𝑠 − 𝐸(𝑠))2 ,
𝑇 𝑖=1 𝑖
Entropy is an essential tool to analyze image unpredictability. The
where 𝐸(𝑠) and 𝐷(𝑠) represent the expectation and variance of 𝑠, distribution of gray values in the image is quantified by entropy.
respectively and the total number of adjacent pixels are represented Entropy is defined as:
by 𝑇 and 𝑠𝑖 , 𝑡𝑖 are values of adjacent pixels in the image. When the
𝑤 −1
2∑
absolute value of the correlation coefficient is smaller, it indicates that 1
𝐻(𝑔) = 𝑃 (𝑔𝑖 ) log2 ,
the correlation between pixels is less. 𝑃 (𝑔𝑖 )
𝑖=1
Figs. 6–9 visualize the change of correlation before and after en-
cryption of the ‘‘Lena’’, ‘‘Baboon’’, ‘‘Peppers’’ and ‘‘Airplane’’ images, where the occurrence probability of 𝑔𝑖 is 𝑃 (𝑔𝑖 ) and 2𝑤 shows the total
respectively. The figures manifest that there is a linear correlation number of 𝑔𝑖 , where 𝑤 represents the total number of pixels in the
between adjacent pixels of the plain image and uniform distribution image. An optimum value of entropy for the gray level images is eight.
of the adjacent pixels for the encrypted image that represents almost Table 2 provides the entropy of the different plain images and the
no correlation between adjacent pixels. The correlation coefficients for respective cipher images encrypted by different schemes. The result
the numerous plain images and their cipher images, which had been en- demonstrates that most of the entropy values of our proposed algorithm
crypted using various schemes, are shown in Table 1 for the horizontal, are significantly closer to the optimum entropy value.
vertical, and diagonal directions. In the successfully encrypted images,
the correlation between adjacent pixels should approach 0. Results 6. Differential attacks
indicate that the correlation between adjacent pixels in the encrypted
image can be removed by the proposed algorithm. In conclusion, The differential attacks include the Number of Pixel Change Rate
the correlation coefficient values are statistically insignificant, i.e. the (NPCR) and the Unified Average Changing Intensity (UACI).

7
G. Biban et al. Chaos, Solitons and Fractals: the interdisciplinary journal of Nonlinear Science, and Nonequilibrium and Complex Phenomena 170 (2023) 113396

Table 1
Comparative correlation analysis of pixels in three directions: Horizontal (H), Vertical (V), and Diagonal (D) for images with our algorithm and other encryption algorithms.

Average

H 0.9604 0.8826 0.9625 0.9363 0.9355

Plain Image V 0.9814 0.8377 0.9725 0.9306 0.9306
D 0.9405 0.7902 0.9393 0.8843 0.8886
H 0.0029 0.0077 0.0015 0.0034 0.0039
Proposed V 0.0030 0.0013 0.0017 0.0078 0.0034
D 0.0095 0.0006 0.0046 0.0050 0.0049
H 0.0069 0.0065 0.0211 0.0229 0.0144
Hosny et al. [5] V 0.0479 0.0337 0.0129 0.0103 0.0262
D 0.0075 0.0244 0.0013 0.0100 0.0108
H 0.0074 0.0113 0.0196 0.0055 0.0110
Hua et al. [9] V 0.0960 0.0005 0.0165 0.0014 0.0286
D 0.0193 0.0136 0.0210 0.0083 0.0156
H 0.0041 0.0055 0.0021 0.0075 0.0048
Li et al. [10] V 0.0021 0.0015 0.0218 0.0084 0.0085
D 0.0009 0.0041 0.0096 0.0011 0.0039
H 0.0056 0.0026 0.0016 0.0028 0.0032
Wu et al. [11] V 0.0037 0.0009 0.0059 0.0041 0.0037
D 0.0032 0.0052 0.0034 0.0010 0.0032
H 0.0023 0.0059 0.0037 0.0062 0.0045
Enayatifar et al. [12] V 0.0019 0.0041 0.0258 0.0074 0.0098
D 0.0011 0.0028 0.0079 0.0009 0.0032
H 0.0061 0.0060 0.0049 0.0054 0.0056
Niyat et al. [13] V 0.0116 0.0058 0.0031 0.0089 0.0074
D 0.0018 0.0016 0.0079 0.0021 0.0034

Table 2
Comparative analysis of entropy values for images with proposed algorithm and other encryption algorithms.

Average

Plain Image 7.4292 7.2297 7.5596 6.6595 7.2195

Proposed 7.9974 7.9974 7.9970 7.9990 7.9977
Hosny et al. [5] 7.9972 7.9975 7.9970 7.9971 7.9972
Hua et al. [9] 7.9976 7.9974 7.9971 7.9971 7.9973
Li et al. [10] 7.9913 7.9912 7.9909 7.9912 7.9912
Wu et al. [11] 7.9976 7.9971 7.9974 7.9970 7.9973
Enayatifar et al. [12] 7.9975 7.9938 7.9958 7.9974 7.9961
Niyat et al. [13] 7.9974 7.9970 7.9972 7.9970 7.9972

Table 3
Comparative analysis of NPCR, UACI values with proposed algorithm and other encryption algorithms.

Average

NPCR 99.6109 99.6033 99.5850 99.5989 99.5995

Proposed
UACI 33.4347 33.4554 33.4363 33.4656 33.4480
NPCR 99.6246 99.5941 99.6033 99.6174 99.6099
Hosny et al. [5]
UACI 33.4226 33.4610 33.4274 33.5053 33.4541
NPCR 99.5850 99.6307 99.6231 99.6231 99.6155
Hua et al. [9]
UACI 33.5582 33.4534 33.6805 33.4665 33.5397
NPCR 99.6200 99.5925 99.6078 99.6231 99.6109
Wu et al. [11]
UACI 33.4196 33.3822 33.4953 33.6358 33.4832
NPCR 99.5193 99.1051 98.4975 99.4176 99.1349
Enayatifar et al. [12]
UACI 33.5851 33.2517 32.9483 33.5254 33.3276

8
G. Biban et al. Chaos, Solitons and Fractals: the interdisciplinary journal of Nonlinear Science, and Nonequilibrium and Complex Phenomena 170 (2023) 113396

Fig. 8. Correlation analysis (a) Peppers plain image (b) Peppers encrypted image.

NPCR is used to measure the change in the number of pixels in gray 7. Conclusion
level in two images. The encrypted images 𝐸 and 𝐸 ′ are encrypted from
an original image with only one bit dissimilar. Let 𝐸(𝑖, 𝑗) and 𝐸 ′ (𝑖, 𝑗) This paper implemented an image encryption method using an
be pixels at the location 𝑖th row and 𝑗th column of two images 𝐸 and FQ-matrix and 8D hyperchaotic system. Firstly, the confusion step is
𝐸 ′ , respectively. The total number of pixels represented by 𝑃 . NPCR is performed to generate random sequences using an 8D hyperchaotic
defined as: system then three of these sequences are chosen to shift the pixel
∑ placement of the gray images. In diffusion operation, each sub-block
𝑖,𝑗 𝐶(𝑖, 𝑗)
𝑁𝑃 𝐶𝑅 = × 100, of the shuffled image has its pixel value which we have changed using
𝑃
the FQ-matrix.
where, The advantage of the proposed image encryption algorithm is that
{
0 if 𝐸(𝑖, 𝑗) = 𝐸 ′ (𝑖, 𝑗), it is based on 8D hyperchaotic system which contains twenty-three
𝐶(𝑖, 𝑗) = terms on the right-hand side and seven control parameters giving large
1 if 𝐸(𝑖, 𝑗) ≠ 𝐸 ′ (𝑖, 𝑗).
key space and providing a very secure image encryption algorithm and
UACI is used to obtain the average change in intensities of two images. generated encryption algorithm produces low time complexity. For the
UACI is defined as: encrypted images, the histogram distribution is uniform, and the corre-
1 ∑ |𝐸(𝑖, 𝑗) − 𝐸 ′ (𝑖, 𝑗)| lation coefficient between adjacent pixels has significantly decreased.
𝑈 𝐴𝐶𝐼 = × 100.
𝑃 𝑖,𝑗 255 Entropy measurement demonstrates that the encrypted image has a
high level of randomness and is extremely close to the optimum entropy
The encryption algorithm is superior when the NPCR and UACI value. The NPCR and UACI values of the proposed encryption algorithm
value is closer to the ideal NPCR and UACI value i.e. 99.6094 and are much closer to the ideal values. We may infer from the analysis
33.4635, respectively. Table 3 represents the NPCR and UACI com- findings that the proposed algorithm provided a good level of security
puted values of the proposed algorithm and the other existing image that facilitates it to protect gray images in the public domain from
encryption algorithms. hackers.

9
G. Biban et al. Chaos, Solitons and Fractals: the interdisciplinary journal of Nonlinear Science, and Nonequilibrium and Complex Phenomena 170 (2023) 113396

Fig. 9. Correlation analysis (a) Airplane plain image (b) Airplane encrypted image.

CRediT authorship contribution statement References

[1] Matthews RA. The use of genetic algorithms in cryptanalysis. Cryptologia

Geeta Biban: Conceptualization, Methodology, Software, Writing – 1993;17(2):187–201.
original draft. Renu Chugh: Supervision, Writing – review & editing. [2] Wang X, Teng L, Qin X. A novel colour image encryption algorithm based on
Anju Panwar: Validation, Supervision, Writing – review & editing. chaos. Signal Process 2012;92(4):1101–8.
[3] Pareek NK, Patidar V, Sud KK. Image encryption using chaotic logistic map.
Image Vis Comput 2006;24(9):926–34.
[4] Khaitan S, Sagar S, Agarwal R. Chaos based image encryption using 3-dimension
Declaration of competing interest
logistic map. Materials Today: Proc 2021.
[5] Hosny KM, Kamal ST, Darwish MM, Papakostas GA. New image encryp-
tion algorithm using hyperchaotic system and fibonacci q-matrix. Electronics
The authors declare that they have no known competing finan-
2021;10(9):1066.
cial interests or personal relationships that could have appeared to [6] Hosny KM, Kamal ST, Darwish MM. Novel encryption for color images us-
influence the work reported in this paper. ing fractional-order hyperchaotic system. J Ambient Intell Humaniz Comput
2022;13(2):973–88.
[7] Hosny KM, Kamal ST, Darwish MM. A color image encryption technique using
Data availability block scrambling and chaos. Multimedia Tools Appl 2022;1–21.
[8] Hosny KM, Kamal ST, Darwish MM. A novel color image encryption based on
fractional shifted Gegenbauer moments and 2D logistic-sine map. Vis Comput
Data will be made available on request 2022;1–8.
[9] Hua Z, Zhou Y, Huang H. Cosine-transform-based chaotic system for image
encryption. Inform Sci 2019;480:403–19.
Acknowledgments [10] Li C, Luo G, Qin K, Li C. An image encryption scheme based on chaotic tent
map. Nonlinear Dynam 2017;87:127–33.
[11] Wu J, Liao X, Yang B. Image encryption using 2D Hénon-Sine map and DNA
The University Grant Commission, India raised funds for this re- approach. Signal Process 2018;153:11–23.
[12] Enayatifar R, Abdullah AH, Isnin IF, Altameem A, Lee M. Image encryption using
search. The authors would like to express their deepest gratitude to the
a synchronous permutation-diffusion technique. Opt Lasers Eng 2017;90:146–54.
anonymous reviewers and editor for their informative suggestions and [13] Niyat AY, Moattar MH, Torshiz MN. Color image encryption based on hybrid
remarks. hyper-chaotic system and cellular automata. Opt Lasers Eng 2017;90:225–37.

10
G. Biban et al. Chaos, Solitons and Fractals: the interdisciplinary journal of Nonlinear Science, and Nonequilibrium and Complex Phenomena 170 (2023) 113396

[14] Sheela SJ, Sanjay A, Suresh KV, Tandur D, Shubha G. Image encryption based [21] Kumar A, Alzabut J, Kumari S, Rani M, Chugh R. Dynamical properties of a
on 5D hyperchaotic system using hybrid random matrix transform. Multidimens novel one dimensional chaotic map. Math Biosci Eng 2022;19(3):2489–505.
Syst Signal Process 2022;33(2):579–95. [22] Kumari S, Chugh R. A new experiment with the convergence and stability of
[15] Gong L, Deng C, Pan S, Zhou N. Image compression-encryption algorithms logistic map via SP orbit. Int. J. Appl. Eng. Res. 2019;14:797–801.
by combining hyper-chaotic system with discrete fractional random transform. [23] Kumari S, Chugh R, Miculescu R. On the complex and chaotic dynamics of
Optics Laser Technol 2018;103:48–58. standard logistic Sine square map. An. ŞtiinŢ. Univ. ‘‘Ovidius’’ ConstanŢa Ser.
[16] Gonzalez RC. Digital Image Processing. third ed.. Pearson education India; 2009. Mat. 2021;29(3):201–27.
[17] Gonzalez RC. Digital Image Processing using MATLAB. Pearson education India; [24] Rani M, Kumar A, Kumari S, Chugh R. Superior tent map. Nonlinear Studies
2004. 2021;28(3).
[18] Batra C, Gupta N, Chugh R, Kumar R. Generalized viscosity extragradient [25] Benkouider K, Bouden T, Yalcin ME, Vaidyanathan S. A new family of 5d, 6d,
algorithm for pseudomonotone equilibrium and fixed point problems for finite 7D and 8D hyperchaotic systems from the 4D hyperchaotic vaidyanathan system,
family of demicontractive operators. J Appl Math Comput 2022;1–28. the dynamic analysis of the 8D hyperchaotic system with six positive Lyapunov
[19] Geeta, Panwar A. Data analysis of COVID-19 pandemic: a mathematical exponents and an application to secure communication design. Int J Model Ident
approach. J. Math. Comput. Sci. 2021;11(6):7568–623. Control 2020;35(3):241–57.
[20] Gupta N, Postolache M, Nandal A, Chugh R. A cyclic iterative algorithm for [26] Hoggatt VE. Fibonacci and Lucas Numbers. Houghton Mifflin; 1969.
multiple-sets split common fixed point problem of demicontractive mappings
without prior knowledge of operator norm. Mathematics 2021;9(4):372.

11