Multimedia Tools and Applications

https://doi.org/10.1007/s11042-021-10734-1

Robust cryptosystem using a new hyperchaotic

oscillator with stricking dynamic properties

Franklin Djimasra1 · Jean De Dieu Nkapkop2 · Nestor Tsafack3 · Jacques Kengne4 ·

Joseph Yves Effa1 · Abdelkrim Boukabou5 · Laurent Bitjoka6

Received: 28 May 2020 / Revised: 21 January 2021 / Accepted: 16 February 2021 /

© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021

Abstract
This paper presents a digital image cryptosystem utilizing a novel dynamic system with
very interesting features. The oscillator is designed by introducing a feedback control law
to the third line of the Lorenz oscillator with exponential nonlinearity. This exponential
nonlinearity is replaced with hyperbolic sine nonlinearity to induce more complexity in
the oscillator. Using some well-known computation analysis tools like Lyapunov spectrum,
bifurcation analysis, and phase portraits representations, the dynamic analysis indicates that
the oscillator can show chaos or hyperchaos for the same parameter space. In addition, the
oscillator is equilibrium free, consequently its attractors are classified as hidden. Finally, the
sequences of the oscillator are utilized to design a robust encryption scheme. Our method
relies on a discrete orthogonal moment, confusion and diffusion stages. The input image is
represented in the transform domain using Hahn orthogonal moments. Chaotic sequences
are used to confuse and diffuse the obtaind image. Various security techniques have been
used with success to show that our encryption process is powerful to resist malicious attacks.

Keywords Hidden attractor · Hyperchaos · Orthogonal moment · Chaotic encryption

 Nestor Tsafack
nestor.tsafack@yahoo.fr

1 Department of Physics, University of Ngaoundéré, P.O. Box 454, Ngaoundere, Cameroon

2 Department of Electrical Engineering and Industrial Computing,
University Institute of Technology, P.O. Box 8698 Douala, Cameroon
3 Research Unit of Laboratory of Condensed Matter, Electronics and Signal Processing
(URMACETS) Department of Physics, Faculty of Sciences, University of Dschang,
P.O. Box 67, Dschang, Cameroon
4 Research Unit of Laboratory of Automation and Applied Computer (LAIA), Electrical Engineering
Department of IUT-FV, University of Dschang, P.O. Box 134, Bandjoun, Cameroon
5 Department of Electronics, University of MSB, Jijel, Algeria
6 Department of Electrical Engineering, Energetics and Automatics, University of Ngaoundéré,
Ngaoundéré, Cameroon
 Multimedia Tools and Applications

1 Introduction
In nonlinear dynamics, chaotic systems are nonlinear dissipative systems with high sensi-
tivity on the small disturbance in initial conditions [19]. There exist in the state-of-the art a
variety of metrics used to characterize chaos dynamics of nonlinear system [8, 37, 39, 40].
Lyapunov exponent is one of these nonlinear dynamics analysis tools. It is a quantitative
analysis of the stability or the instability of the system’s trajectories. The degree of a sys-
tem defines its amount of Lyapunov exponents which are either positive, negative or equal
to zero real numbers [21, 32, 40].
A chaotic system can be defined by a positive maximum Lyapunov exponent. Lately a
variety of system with chaos dynamics have been suggested and studied to illustrate com-
plicated dynamics. This interest is mainly due to possible applications in engineering. In
1963 Lorentz design a system which displays a butterfly chaos representing a forced dissi-
pative hydrodynamics flow [28]. From this seminal contribution, many contributions have
been interested in modifying this oscillator including Zhouchao and collaborators [46]. The
later designed and investigated a new 3-D autonomous Lorenz-like chaotic system. The par-
ticular interest found in this precious work is the presence of double scroll chaos in a wide
range of parameter. In 2005, Li and co-workers proposed a method to construct new 4D
Lorenz-like chaotic system from 3-D Lorenz-like chaotic system. It is important to stress
and lament the low level maximum Lyapunov exponent in recent works. Let us mention that
a chaotic system with high Lyapunov exponent is suitable for designing strong cryptosys-
tems. In addition to this, high dimensional chaotic or hyperchaotic system can be used to
increase the robustness of engineering usability.
Hyperchaos is a nonlinear behavior encountered in dissipative oscillators with a mini-
mal dimension four and a minimum of two Lyapunov exponents with positive real values.
Since the discovery of the first hyperchaotic system by Rossler [36], a battery of hyper-
chaotic systems have been reported including Lorentz like hyperchaotic systems [10, 18,
23]. The most common techniques actually used to generate hyperchaotic dynamic system
from chaotic or non hyperchaotic system is the addition of a control law to the system with-
out hyperchaos. Let us note that this technique is very attractive and is still a challenging
task. Li et al. proposed a hyper-chaotic system by the above mentioned method [22]. The
proposed system demonstrated a complicated dynamics through bifurcation and Lyapunov
exponents. Murali and collaborators presented another method of generating hyperchaotic
attractors from chaotic circuits based on diode as the unique nonlinear element responsible
for the complicated dynamics in the circuit [31]. The method of building uses active linear
blocks and passive nonlinearities.
The above mentioned advances in the field of chaos and hyperchaos are usefull in engi-
neering domain including image cryptosystems [50]. Generally speaking, image encryption
consists of modifying the intensity values and positions of the pixels on an original image.
A variety of cryptosystems can be found in the literature and classified either as spatial
domain or frequency domain encryption algorithms. The first method directly consider the
pixel of the original image without any transformation. The second method apply a mathe-
matical transformation on the original image to compute some coefficients based on image
pixels. Transform domain based algorithms seems to be more efficient and robust than spa-
tial domain. In this paper we will combine the discrete Hahn moment coefficients of the
plain image and hyperchaos based encryption keys to design a robust algorithm.
However, chaotic encryption have been extensively addressed but without the use of
discrete moments. Since the seminal work of Mattews on chaotic encryption in 1989 [30],
many researchers have focused attention on this prominent field. [1, 2, 6, 7, 29, 34, 35]. Two
Multimedia Tools and Applications

dimensional chaos cryptosystems is the topic of many publications [9, 27]. Beside these
work, some author used high dimensional chaotic system and claim that the higher the order
of the map the stronger the robustness of the algorithm. For instance, Gao and collaborators
designed a Chen cryptosystem [15]. Bi and collaborators used hyperchaos to establish the
encryption key of an encryption algorithm with good experimental performance. It should
be however mentioned that all these encryption method can be classify as spatial domain
encryption where the algorithm is directly applied on the pixel of the original image without
any transformation.
To sum up, the main contributions of the present work include:
1. High Lyapunov exponents and dimension map is designed to achieve hyperchaos
dynamics;
2. Investigate the dynamics of the proposed map to identify in the parameter space the
windows of complicated dynamics suitable for encryption;
3. Design a robust encryption algorithm with good experimental performance. Our algo-
rithm is based on the combination of the discrete Hahn moment coefficients of the plain
image and the proposed hyperchaotic system for key construction;
4. Deploy a variety of metrics for experimental validation of the proposed algorithm
including histogram analysis, Shannon entropy analysis, NPCR and UACI, Noise attack
and occlusion attacks.

2 Dynamics of the novel oscillator

2.1 Description of the novel oscillator

Recently Wei and Yang presented a novel 3-D chaotic oscillator topologically different to
all forms of Lorenz oscilator [45]. The oscilator is characterized by quadratic and exponen-
tial nonlinearity and stable equilibrium. To construct a new 4-D hyperchaotic oscillator with
interesting dynamics, we introduced nonlinear feedback controller to the system. Addition-
ally, the exponential nonlinearity is change to hyperbolic sine nonlinearity. The result is
given in the sequel:
⎧ dx
⎪
⎪ = a(y − x)
⎨ dτdy
dτ = −by + xz + cv (1)
⎪
⎪
dz
= d − ε sinh(xy)
⎩ dτ
dτ = −mx
dv

The initial values are defined as w(0) = [ 1 0 0 0 ]T , a = 0.87, b = 0.5, d = 1.5, m = 0.5,
ε = 0.000000035 are system’s parameters. One of them, c, will be used in the whole work
as control parameter c ∈ [0, 150].

2.2 Equilibrium of system and existence of attractor

Before we start the numerical analysis of the proposed system it is of great interest to ana-
lyze possible fixe point of the oscillator. This helps to characterize the local dynamics of the
system around its equilibria. For the system described in (1) these points can be investigated
setting the derivatives of state variable to zero to find x, y, z, v. Obviously, this operation
yield unsubstantial values. Consequently the system described in (1) has no equilibrium
points and the attractors can be classified as hidden.
 Multimedia Tools and Applications

To foretell the existence of attractors for the system described in (1), It is also important
to compute the divergence of the oscillator. By doing this computation, the system is non
conservative given that the divergence is obtained as Δ = −a − b < 0. This result simply
indicate that a given initial volume element V0 = V (t = 0) containing the trajectory of
the system will be always shrinked to zero by the flow. As consequence, any asymptotic
movement converges to an attractor. As above mentioned the system has no equilibrium, the
obtained attractor will be characterized as hidden attractor.

2.3 Bifurcation and Lyapunov spectrum of the novel oscillator

System described in (1) is solved for a very small time step (τ = 0.0001) and the solutions
are stored for a sufficiently long time. To analyse the system in depth, parameters are fixed
as a = 0.87, b = 0.5, d = 1.5, m = 0.5, ε = 0.000000035 and the values of variable x are
stored to plot the bifurcations Fig. 1. Lyapunov spectrum is also computed and represented
in Fig. 2.
Let us recall that considering an autonomous dissipative nonlinear oscillator, Lyapunov
exponents are important tools currently used to evaluate the complexity of the produced
sequences. Considering the Lyapunov exponents (represented here in the field 0 ≤ c ≤ 150)
three cases can be considereed:

1. If λ1 > 0, we conclude that the system described in (1) is chaotic. Also, if λ1 is large
enough, this shows that close orbits diverge quickly;
2. If λ1 > 0 and λ2 > 0, we conclude that the system described in (1) is hyperchaotic.
3. If λ1 ≤ 0, the dynamic of the system described in (1) is periodic.

From the results in Fig. 2 it is obvious that λmax is always positive and get more substantial.
Consequently, close trajectories diverge faster. In addition the second Lyapunov exponent is
positive indicating hyperchaos in the whole range of parameter. Figure 3 illustrates various
representations of hyperchaotic attractors for a = 0.87, b = 0.5, c = 121, d = 1.5, m = 0.5,

Fig. 1 Bifurcations of the hyperchaotic system

Multimedia Tools and Applications

Fig. 2 Highest Lyapunov exponent of the hyperchaotic system

ε = 0.000000035. Initial conditions are (1, 0, 0, 0). The complexity of the attractor can be
analysed using the Kaplan-York definition as:

1 
k
DL = k + λi (2)
|λk+1 |
i=1

 
Where k is subjected to ki=1 λi ≥ 0 and k+1 i=1 λi < 0 with λi ≥ λi+1 . Setting system’s
parameters as a = 0.87, b = 0.5, c = 121, d = 1.5, m = 0.5, ε = 0.000000035 the Lyapunov
dimension of the system described in (1) is found as DL = 3.688 showing the fractal nature
of the oscillator (Fig. 3).

3 Chaotic image encryption

Hahn orthogonal moment matrix of the input image is estimated. The obtained matrix is
then confused and diffused.

3.1 Hahn orthogonal moment

Let us consider a given M × N digital image f (x, y). The Hahn moment [16] of the image
is computed as:

 N−1
N−1 
Hmn = f (x, y)h̃(μ,υ)
m (x, M)h̃(μ,υ)
n (y, N ); m, n = 0, 1, ..., N − 1 (3)
x=0 y=0

The reverse moment operation to recover the input image is given by:

 N−1
N−1 
f (x, y) = Hmn h̃(μ,υ)
m (x, M)h̃(μ,υ)
n (y, N ) (4)
m=0 n=0
 Multimedia Tools and Applications

Fig. 3 Various vues of the phase portrait of the hyperchaotic system

Where h̃ is the scaled Hahn polynomial used to ensure the numerical stability and
described as:

ρ(x)
h̃(μ,υ)
n (x, N ) = h(μ,υ)
n (x, N ) , n = 0, 1, ..., N − 1 (5)
dn2

and dn2 represents the norm which has the following expression:

Γ (2N + μ + υ − n)
dn2 =
(2N + μ + υ − 2n − 1)Γ (N + μ + υ − n)
1
× (6)
Γ (N + μ − n)Γ (N + υ − n)Γ (n + 1)Γ (N − n)

And ρ(x) represents the function of weight given by:

1
ρ(x) = (7)
Γ (x + 1)Γ (x + μ + 1)Γ (N + υ − x)Γ (N − n − x)
Multimedia Tools and Applications

(μ,υ)
hn (x, N ) are the Hahn polynomials defined as:

n
(−n)k (−x)k (2N + μ + υ − n − 1)1 1
h(μ,υ)
n (x, N ) = (N +υ −1)n (N − 1)n × (−1)k
(N + υ − 1)k (N − 1)k k!
k=0
(8)
μ, υ (μ > −1, υ > −1) are fitting parameters that control the shape of polynomials.

3.2 Hahn moment based encryption scheme

First, the Hahn moment coefficients of an original image of size M ×N are calculated using
formula (3). The image is therefore represented in the transform domain of moments as
M ×N matrix H . For confusion phase, positions of the pixels are changed without changing
the actual values of the pixels, which destroys the affiliation among adjacent pixels and
thus makes the image unrecognizable. This phase end with the confused matrix C of size
M × N . For diffusion, the intensity values are altered so that a small modification in one
pixel propagates on several pixels in order to hide the statistical structure of the plaintext.
We then obtain the encrypted image D of size M × N . The sequences used in the confusion
and the diffusion are generated from our hyperchaotic oscillator with a secret key. The entire
algorithm is detailed step by step in the sequel:
Step 1: Upload the original M × N image I to the cryptosystem. The Hahn moment coef-
ficients of the original image are calculated using formula (3) to represent the
image in the transform field of moments as a new matrix labeled A.
Step 2: Define the initial seed as x0 = 1; y0 = 0; z0 = 0; v0 = 0 and system’s parameter as
a = 0.87, b = 0.5, c = 121, d = 1.5, m = 0.5, ε = 0.000000035. Use the fourth order
Runge–Kutta algorithm to solve our hyperchaotic oscillator (dimension l = 4)
with the above initial seed and parameters to generate four sequences x; y; w; v.
Note that the time step should be less than 0.001. But this restriction is not suffi-
cient. In addition, the resolution should be done in the time domain [t0 ; tn ] with
the sampling time Δt. For our algorithm to be flexible to all gray-scale images
regardless the size, the number of samples should always verify the following
formula: (tn − t0 )/t = M × N .
Step 3: generate the key stream using (9):

T (4 × (k − 1) + i) = abs (y (k, i)) − f loor (abs (v (k, i))) ; (9)

The final key stream is obtained by considering the index of each component of
the data vector T in the data vector x as K = index (T inX).
Step 4: Obtain the encrypted image E by performing a bit XOR process between the
key stream and the input image A represented in the transform domain of Hahn
moments: E = bitxor (A, K)

3.3 Security investigation of the proposed cryptosystem

It is very important to address the evaluation of the robustness of the proposed algorithm.
Visual test is one of the usual evaluation tool, but we should not rely on it exclusively [13].
Other evaluation tool had been proposed to judge the robustness of the encryption algo-
rithm more objectively [5, 11, 12, 24]. To validate the effectiveness of the newly introduced
moments’ founded encryption scheme, a set of experiments is carried out and presented in
the sequel. For each metric, we address the test, then we present the results and we compare
 Multimedia Tools and Applications

them with some recent and strong cryptosystem in the literature. This evaluation study uses
a set of six gray scale images of size 256 × 256 shown in Fig. 4 but the algorithm is opened
to any images of any size (Fig. 4).

3.3.1 Histogram analysis

Visual test alone cannot be used to testify the robustness of an encryption algorithm. In
addition to this test a battery of metrics can be used including histogram test [44, 47, 49].
Considering our algorithm and the set of test images, histogram analysis have been investi-
gated and the result is shown in Fig. 5. These results indicate that our cryptosystem achieves
uniformly distributed histogram for encrypted images. Consequently can resist statistical
cryptanalysis based on histogram.

3.3.2 Correlation coefficient analysis

It is always interesting to use correlation coefficient which is a statistical test robustness of

a cryptosystem against statistical attacks. The values are confined between 1 and −1. The
input image and the output image are perfectly correlated when the correlation coefficient
is 1. When the correlation coefficient is 0 the input image and the output image are highly
decorrelated. Let us mention that a good encryption algorithm must yield to correlation
coefficients near to zero [26]. To assess the robustness of our cryptosystem, the correlation
coefficient was computed using the following formula between the plain images and their
corresponding ciphers:
cov(x, y)
C.C = √ √ (10)
D(x) D(y)
 1 L
whith cov(x, y) = L1 L l=1 (x(l) − E(x))(y(l) − E(y)); D(x) = L l=1 (x(l) − E(x)) ;
2

E(x) = L 1
and L represents the total number of pixels in the image.
L l=1 x(l)
To show the superiority of our algorithm over some robust existing algorithms in the
literature, we encrypt each image from the image test set using both our Hahn moment
based encryption algorithm and the strong and recent algorithms in [4, 20, 49]. The results
obtained are presented in Table 1.
Based on these results it is evident that the correlation coefficient is near to zero for
encryption scheme suggesting that the suggested algorithm is robust. In addition the exper-
imental results demonstrates that our Hahn based encryption algorithm is relatively more
effective than the state-of-the-art algorithms.

3.3.3 Shannon entropy

In the field of cryptography, entropy is a metric used to assess the degree of randomness and
unpredictability in the encrypted message. As the level of disorder rises the entropy rises
and become less predictable given that mutual information among pixels decreases [17].
Entropy value H (m) of any data m is computed by the formula :
n −1
2
1
H (m) = p(mi ) × log2 (11)
p(mi )
i=0
p (mi ) represents the probability of occurrence of a given pixel mi . An encryption algo-
rithm is good when the entropy of an 8-bit image is very closed to 8. Consequently the
algorithm cannot provide any information about the original image given an encrypted
Multimedia Tools and Applications

Fig. 4 Test images and corresponding encrypted images illustrating visuals test
 Multimedia Tools and Applications

Fig. 5 Histogram analysis of the plain and cypher images

image [25]. It is well-known that the local entropy is better than the global entropy as
randomness measure tool [14]. The results presented in Table 2 clearly show that the imple-
mented algorithm gives a high value of entropy i.e. very close to 8, which exhibits a high
Multimedia Tools and Applications

Table 1 Comparative analysis with respect to Correlation coefficient

Test images Direction Khan and Ahmad [20] Ahmad [4] Proposed work

img1 H 0.033 0.0245 0.0005

V 0.0068 0.0295 −0.0032
D −0.0474 −0.0391 −0.0032
img2 H 0.0184 −0.0430 0.0127
V 0.0032 0.0026 −0.0032
D 0.0285 0.0028 −0.0013

Best results are shown in bold

efficiency of our algorithm. Furthermore Table 2 provide a comparison of our encryption

method with some state-of-the-art encryption methods. Simple observation shows that our
algorithm is advanced over existing ones regarding the entropy.

3.3.4 Robustness against differential attack: NPCR and UACI analysis

Differential cryptanalyst use the difference between two encrypted images according to
the average intensity to break an encryption algorithm. In effect he encrypt two different
images (the plain image and the plain image with a small change) and observe the differ-
ence between the encryption results to obtain the encryption key [25]. A robust encryption
algorithm should resist to this attack by achieving the standard values both of NPCR and
UACI defined in the sequel:

D(i, j )
i;j 0 if A1 (i, j ) = A2 (i, j )
N P CRs = × 100% = 99.61% , D(i, j ) =
m×n 1 if A1 (i, j )  = A2 (i, j )
(12)
100  m  n |A1 (i, j ) − A2 (i, j )|
U ACIs = = 33.46% (13)
m×n 1 1 255
Where A1 and A2 are the pixel values at position (i, j ). To evaluate the security of the
proposed algorithms against differential attacks. First we compute NPCR and UACI for each
cipher image, second we compute the maen values of NPCR and UACI then we compare
to some robust encryption algorithm of the state-of-the-art. The corresponding outcomes
are illustrated in Tables 3. A look at these results indicates that Hahn based encryption
algorithms has the higher values of NPCR and UACI for the majority of test images showing
that the proposed encryption algorithm exhibit good performance for differential attacks
over some state-of-art algorithms [38, 41, 42].

Table 2 Comparative analysis in

terms of Shannon entropy Algorithms Local entropy Global entropy

Farah et al. [14] 7.9030 7.9995

Sivakumar and Li [38] 7.9027 7.9976
Liang and Shi [25] 7.9025 7.9972
Proposed 7.9072 7.9981
Best results are shown in bold
 Multimedia Tools and Applications

Table 3 Comparative analysis in

terms of NPCR and UACI Algorithms NPCR UACI

Tsafack et al. [41] 99.47000 33.30000

Liang and Shi [25] 99.25000 33.19000
Tsafack et al. [42] 99.19000 33.18000
Proposed 99.59138 33.38615
Best results are shown in bold

3.3.5 Robustness against Brute force attack

Brute force attack consists of testing a series of key attempting to break a cipher. This is
called exhaustive key search. To ensure that an algorithm is sufficiently robust to resist
such attack, the key range must be above 2100 [38]. Considering the key parameters of our
cryptosystem ( a, b, c, d, m, ε, x0 , y0 , z0 , v0 ) the total key range is found around 10160 . It
is obvious that our algorithm can withstand to brute force attacks given our total key range
is highly above the threshold value.

3.3.6 Occlusion analysis

The network is usualy disturbed during the transmission process, the transmitted image
may be occluded [33]. It is therefore highly recommended for a decryption algorithm to
withstand the occlusion and recover the original image. The results of this test are given in
Fig. 6 for Boat image where it is obvious that the recover image is recovered with acceptable
error.

Fig. 6 Results of occlusion test

Multimedia Tools and Applications

Fig. 7 Salt-and-pepper noise analysis results

 Multimedia Tools and Applications

3.3.7 Key space analysis

The key space of an encryption algorithm is the product of all the keys used in the encryp-
tion protocol (Ks = Πi=1 n k where Ks is the key space and k are the keys related to the
i i
encryption process) [3]. The key space of a good encryption should be greater than 2100
so that the algorithm can resist to brute force attacks. For this case we considered 10 keys
at least (x0 , y0 , w0 , v0 , a, b, c, d, m, ε). If the calculation accuracy of each key is consid-
ered to be 1016 then the key space of the whole algorithm is 10160 . This value is greater
than the threshold value (2100 ) consequently the considered algorithm can resist to brute
force attacks. Let us mention that when initial conditions are used as key for any encryption
algorithm, special care need to be taken to avoid non-chaotic or non-hyperchaotic regions
[43].

3.3.8 Key sensitivity

Key sensitivity is a metric commonly used to test the robustness of a cryptosystem. Our
cryptosystem produces different output when a slight change is done on the encryption key
(a, b, c, d, m, ε, x0 , y0 , z0 , v0 ). To illustrate this test a slight change is done on four of the
above mention keys (two system parameters a, b and two initial conditions (x0 , y0 ) to obtain
four slightly wrong keys. We consider a correctly encrypted image (that is with correct key)
and then we show by the use of local entropy (see Table 4) that the later encrypted image
cannot be decrypted using the four slightly wrong keys.

3.3.9 Noise attack analysis

Any transmission trunk always contain noise which may affect the transmitted message.
Salt-pepper noise is one of the most common noise found in transmission channels [48,
49]. A robust encryption algorithm must resist to noise such that given an encrypted image
infected by the noise in the transmission trunk, the algorithm can decrypt the erroneous mes-
sage with an acceptable error. To prove that our cryptosystem can withstand noise attacks,
a sample of high level of Salt-pepper noise is aggregate to the encryption version of our

Table 4 Key sensitivity analysis using local entropy

Decryption key Local entropy of the

decrypted image

Correct key: a = 0.87, b = 0.5, c = 121, d = 1.5, m = 0.5,

ε = 0.000000035, x0 = 1, y0 = 1, z0 = 1, v0 = 1 7.1028
Wrong key 1: a = 0.870000000001, b = 0.5, c = 121, d = 1.5,
m = 0.5, ε = 0.000000035, x0 = 1, y0 = 1, z0 = 1, v0 = 1 7.9072
Wrong key 2: a = 0.87, b = 0.500000000001, c = 121, d = 1.5,
m = 0.5, ε = 0.000000035, x0 = 1, y0 = 1, z0 = 1, v0 = 1 7.9072
Wrong key 3: a = 0.87, b = 0.5, c = 121, d = 1.5,
m = 0.5, ε = 0.000000035, x0 = 1.0000001, y0 = 1, z0 = 1, v0 = 1 7.9072

Wrong key 4: a = 0.87, b = 0.5, c = 121, d = 1.5,

m = 0.5, ε = 0.000000035, x0 = 1, y0 = 1.0000001, z0 = 1, v0 = 1 7.9072
Multimedia Tools and Applications

test images. Our proposed algorithm is then used to decrypt these erroneous messages. Out-
comes are confined in Fig. 7. From these outcomes it clear that the decrypted images are in
human-readable forms though they have been infected during the transmission process.

4 Concluding remarks

This work suggested a new digital image cryptosystem utilizing orthogonal moment jointly
with hypechaos. A dynamic system is designed with hidden hyperchaos attractors. Its com-
plex dynamics was demonstrated utilizing some well-known dynamic analysis tools like
Lyapunov exponent, bifurcation diagram, and phase space trajectories. The results indicate
that the proposed system is very interesting regarding the large value of the Lyapunov expo-
nent. in addition the oscillator experieces hidden hyperchaos. The complicated dynamics
of the suggested hyperchaotic oscillator is combined to discrete orthogonal moment coef-
ficients to design a robust image encryption algorithm. Our method relies on a discrete
orthogonal moment, confusion and diffusion stages. The input image is represented in the
transform domain using Hahn orthogonal moments. Chaotic sequences are used to confuse
and diffuse the obtaind image. We deployed a variety of metrics for experimental validation
of the proposed algorithm including histogram analysis, Shannon entropy analysis, NPCR
and UACI analysis, key space analysis, Key sensitivity analysis, Noise attack analysis and
occlusion analysis. These metrics show the superiority of our algorithm over some robust
state-of-art algorithms. In future work we intend to combine discrete orthogonal moment
and s-box to design and implement on raspberry board a new robust encryption algorithm.

Acknowledgements TSAFACK Nestor is grateful to Prof. KENGNE Jacques for his inestimable broad
knowledge, common sense, and ability to analyze intricate problems crucial to the success of this research
work.

References

1. ABD El-Latif AA, Li L, Wang N, Han Q, Niu X (2013) A new approach to chaotic image encryption
based on quantum chaotic system, exploiting color spaces. Signal Process 93(11):2986–3000
2. Abbas NA (2016) Image encryption based on independent component analysis and arnold’s cat map.
Egyptian Informatics Journal 17(1):139–146
3. Abd El-Latif AA, Abd-El-Atty B, Mazurczyk W, Fung C, Venegas-Andraca SE (2020) Secure data
encryption based on quantum walks for 5g internet of things scenario. IEEE Trans Netw Serv Manag
17(1):118–131
4. Ahmad J, Khan MA, Ahmed F, Khan JS (2018) A novel image encryption scheme based on orthogonal
matrix, skew tent map, and xor operation. Neural Comput Appl 30(12):3847–3857
5. Ahmed HEDH, Kalash HM, Allah OF (2007) Encryption efficiency analysis and security evaluation of
rc6 block cipher for digital images. In: 2007 International conference on electrical engineering. IEEE,
pp 1–7
6. Alvarez G, Li S (2003) Cryptographic requirements for chaotic secure communications,
arXiv:nlin/0311039
7. Auyporn W, Vongpradhip S (2015) A robust image encryption method based on bit plane decomposition
and multiple chaotic maps. Int J Signal Process Syst 3(1):8–13
8. Bao B, Hu F, Chen M, Xu Q, Yu Y (2015) Self-excited and hidden attractors found simultaneously in a
modified Chua’s circuit. International Journal of Bifurcation and Chaos 25(05):1550075
9. Belazi A, Hermassi H, Rhouma R, Belghith S (2014) Algebraic analysis of a rgb image encryption
algorithm based on dna encoding and chaotic map. Nonlinear Dyn 76(4):1989–2004
10. Brucoli M, Carnimeo L, Grassi G (1996) A method for the synchronization of hyperchaotic circuits.
International Journal of Bifurcation and Chaos 6(09):1673–1681
 Multimedia Tools and Applications

11. El Fishawy NF, Zaid OMA (2007) Quality of encryption measurement of bitmap images with rc6, mrc6,
and Rijndael block cipher algorithms. IJ Network Security 5(3):241–251
12. El-Ashry I (2010) Digital image encryption, MS. c Thesis, Electronics and Electrical Communications
Engineering Department, Faculty of Electronic Engineering, Menofia University
13. Elkamchouchi H, Makar M (2005) Measuring encryption quality for bitmap images encrypted with Rijn-
dael and Kamkar block ciphers. In: Proceedings of the twenty-second national radio science conference,
2005. NRSC 2005. IEEE, pp 277-284
14. Farah MB, Guesmi R, Kachouri A, Samet M (2020) A novel chaos based optical image encryption using
fractional fourier transform and dna sequence operation. Opt Laser Technol 121:105777
15. Gao T, Chen Z (2008) A new image encryption algorithm based on hyper-chaos. Phys Lett A
372(4):394–400
16. JZhou J, Shu H, Zhu H, Toumoulin C, Luo L (2005) Image analysis by discrete orthogonal hahn
moments. In: International conference image analysis and recognition. Springer, pp 524–531
17. Jithin K, Sankar S (2020) Colour image encryption algorithm combining, arnold map, dna sequence
operation, and a mandelbrot set. J Inf Secur Appl 50:102428
18. Kapitaniak T (1994) Synchronization of chaos using continuous control. Phys Rev E 50(2):1642
19. Kengne J, Tsafack N, Kengne LK (2018) Dynamical analysis of a novel single opamp-based
autonomous lc oscillator: antimonotonicity, chaos, and multiple attractors. Int J Dyn Control 6(4):1543–
1557
20. Khan JS, Ahmad J (2019) Chaos based efficient selective image encryption. Multidim Syst Sign Process
30(2):943–961
21. Leutcho G, Kengne J, Kengne LK (2018) Dynamical analysis of a novel autonomous 4-d hyperjerk
circuit with hyperbolic sine nonlinearity: Chaos, antimonotonicity and a plethora of coexisting attractors.
Chaos, Solitons & Fractals 107:67–87
22. Li Y, Chen G, Tang WKS (2005) Controlling a unified chaotic system to hyperchaotic. IEEE Trans
Circuits Syst II: Express Briefs 52(4):204–207
23. Li Y, Tang WK, Chen G (2005) Hyperchaos evolved from the generalized lorenz equation. Int J Circuit
Theor Appl 33(4):235–251
24. Lian S (2008) Multimedia content encryption: techniques and applications. CRC Press, Boca Raton
25. Liang J, Shi Z (2004) The information entropy, rough entropy and knowledge granulation in rough set
theory. International journal of uncertainty, fuzziness and knowledge-based systems 12(01):37–46
26. Liu Y, Jiang Z, Xu X, Zhang F, Xu J (2020) Optical image encryption algorithm based on hyper-chaos
and public-key cryptography. Opt Laser Technol 127:106171
27. Liu H, Kadir A (2015) Asymmetric color image encryption scheme using 2d discrete-time map. Signal
Process 113:104–112
28. Lorenz EN (1969) The predictability of a flow which possesses many scales of motion. Tellus 21(3):289–
307
29. Luo Y, Zhou R, Liu J, Cao Y, Ding X (2018) A parallel image encryption algorithm based on the
piecewise linear chaotic map and hyper-chaotic map. Nonlinear Dynamics 93(3):1165–1181
30. Matthews R (1989) On the derivation of a “chaotic” encryption algorithm. Cryptologia 13(1):29–42
31. Murali K, Lindberg E, Leung H (2002) Design principles of hyperchaotic circuits. In: AIP Conference
proceedings, vol 622. American Institute of Physics, pp 15–26
32. Negou AN, Kengne J (2018) Dynamic analysis of a unique jerk system with a smoothly adjustable
symmetry and nonlinearity: Reversals of period doubling, offset boosting and coexisting bifurcations.
AEU-Int J Electron C 90:1–19
33. Njitacke ZT, Isaac SD, Tsafack N, Kengne J (2020) Window of multistability and its control in a simple
3d hopfield neural network: application to biomedical image encryption. Neural Comput and Applic:
1–20
34. Nkapkop JDD, Effa JY, Borda M, Bitjoka L, AMohamadou A (2017) Chaotic encryption scheme based
on a fast permutation and diffusion structure. Int Arab J Inf Technol 14(6):812–819
35. Nkapkop JDD, Effa JY, Borda M, Terebes R (2015) A novel fast and secure chaos-based algorithm
for image encryption. In: International conference for information technology and communications.
Springer, pp 87–101
36. Rossler O (1979) An equation for hyperchaos. Phys Lett A 71(2-3):155–157
37. Signing VF, Kengne J (2018) Coexistence of hidden attractors, 2-torus and 3-torus in a new simple 4-d
chaotic system with hyperbolic cosine nonlinearity. Int J Dyn Control 6(4):1421–1428
38. Sivakumar T, Li P (2019) A secure image encryption method using scan pattern and random key stream
derived from laser chaos. Opt Laser Technol 111:196–204
39. Tsafack N, Kengne J (2018) A novel autonomous 5-d hyperjerk rc circuit with hyperbolic sine function.
The Scientific World Journal
Multimedia Tools and Applications

40. Tsafack N, Kengne J (2019) Complex dynamics of the chua’s circuit system with adjustable symmetry
and nonlinearity: Multistability and simple circuit realization. World 4(2):24–34
41. Tsafack N, Kengne J, BAbd-El-Atty B, Iliyasu AM, Hirota K, Abd EL-Latif AA (2020) Design and
implementation of a simple dynamical 4-d chaotic circuit with applications in image encryption. Inform
Sci 515:191–217
42. Tsafack N, Nkapkop JDD, Jacques K, Yves EJ, Iliyasu AM, Abd El-Latif AA (2020) A multidimen-
sional hyperjerk oscillator: Dynamics analysis, analogue and embedded systems implementation, and its
application as a cryptosystem. Sensors 20(1):83
43. Tsafack N, Sankar S, Abd-El-Atty B, Kengne J, Jithin K, Belazi A, Mehmood I, Bashir AK, Song OY,
Abd El-Latif AA (2020) A new chaotic map with dynamic analysis and encryption application in internet
of health things. IEEE Access 8:137731–137744
44. Wang X, Zhao H, Wang Y (2019) A new image encryption algorithm with nonlinear-diffusion based on
multiple coupled map lattices. Opt Laser Technol 115:42–57
45. Wei W, Yang Q (2011) Dynamical analysis of a new autonomous 3-d chaotic system only with stable
equilibria. Nonlinear Anal Real World Appl 12(1):106–118
46. Wei Z, Zhang W (2014) Hidden hyperchaotic attractors in a modified lorenz–stenflo system with only
one stable equilibrium. International Journal of Bifurcation and Chaos 24(10):1450127
47. Wu J, Luo X, Zhou N (2013) Four-image encryption method based on spectrum truncation, chaos and
the modfrft. Opt Laser Technol 45:571–577
48. Xu L, Gou X, Li Z, Li L (2017) A novel chaotic image encryption algorithm using block scrambling and
dynamic index based diffusion. Opt Lasers Eng 91:41–52
49. Zhu C, Wang G, Sun K (2018) Cryptanalysis and improvement on an image encryption algorithm design
using a novel chaos based s-box. Symmetry 10(9):399
50. Zhu S, Zhu C (2018) Image encryption algorithm with an avalanche effect based on a six-dimensional
discrete chaotic system. Multimed Tools Appl 77(21):29119–29142

Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps
and institutional affiliations.