Appl. Math. Inf. Sci. 7, No. ?

, 1-8 (2013) 1
Applied Mathematics & Information Sciences
An International Journal

http://dx.doi.org/10.12785/amis/paper

Chaos in new polynomial discrete logistic maps with

fractional derivative and applications for text encryption
Zoukalne Kalsouabe1,3,4 , Ahamat Mahamat Hassane1,3,4 ,Mahamoud Youssouf Khayala4 and Paul Woafo1,2∗
1 Laboratory on Modelling and Simulation in Engineering, Biomimetics and Prototypes, and TWAS Research Unit, Faculty of Science,
University of Yaounde I, Box 812, Yaounde, Cameroon
2 Laboratory of Products Development and Entrepreneurship, Institut Suprieur de l’Innovation et de Technologie, P.O. Box 8210
Yaound, Cameroon
3 Techno-pedagogy Unit, Virtual University of Chad, Box 5711, N’djamena, Chad
4 Physics and Engineering Science Training, Sciences-Technology-Environment Doctoral School, University of N?Djamena, Box 1117,
N’Djamena, Chad.

Received: ..., Revised: ..., Accepted: ...

Published online: ...

Abstract: In this paper, we propose new polynomial discrete logistic equations based on the classical logistic map, which exhibit
chaotic behavior as control parameters vary. We also explore versions with fractional derivatives. Using the chaotic sequence generated
by these equations, we develop an encryption scheme for text. The scheme relies on initial conditions, control parameters, and a
transformation of text characters into values between 0 and 1, followed by a transformation to discrete chaotic values for transmission

Keywords: Polynomial discrete maps; logistic equation; fractional order; chaos; text encryption

1 Introduction research works have been carried out on the use of

discrete time sequences[8, 9, 10, 11, 12]. Discrete chaotic
Since the emergence of digital communications systems, systems are generally defined by the equation (1):
telecommunication systems have evolved till the
deployment of 5G. This technological evolution has xn+1 (= f (xn , r). (1)
facilitated the exchange of data through Internet, where xn ∈ Rn ,R p ,n=1,2,3..., f is a vector function of its
computer networks, USB keys, and many other devices. arguments and p designing the number of parameters r.
In this context of widespread information exchange, the The well-known and simple discrete maps leading to chaos
security becomes a priority. This necessitates the was developed by the biologist Robert May in 1976[13]. It
development of new cryptographic algorithms to is described by the following equation (1):
complement the existing ones such as DES (Data
Encryption Standard)[1], AES (Advanced Encryptions xn+1 = rxn (1 − xn ) (2)
Standard)[2], RSA (Rivest, Shamir, and Adleman)[3],
RC4 (Rivest Cipher 4)[4]. Indeed, these existing It is the discrete version of the logistic equation derived
algorithms have shown their limits in view of the by Verhulst to describe the evolution of a population in a
exponential evolution of the volume of exchanges and the given environment where r is the control parameter[14,
space of encryption keys. Encryption algorithms using 15]. This simple logistic map was used for text encryption
chaotic attractor-based pseudo-random or quasi-random by Baptista[16] using a division of the interval in which
number generators came with the advantages of their the discrete values xn belong. This was later improved
fundamental properties such as sensitivity to the initial using modified versions[17, 18]. In the same line, Xiao et
state or to the system parameter leading to best means of al. proposed a dynamic lookup table using the logistic
confusion, diffusion, and other encryption keys[5, 6, 7]. map to improve the security of the Baptista
Since the introduction of chaos in cryptography, several algorithm[19]. In 2019, another improvement was
∗ Corresponding author e-mail: [email protected]
c 2013 NSP
Natural Sciences Publishing Cor.
2 Z.Kalsouabe,M.H.Ahamat,Y.K.Mahamoud and P.Woafo: Chaos in new polynomial discrete logistic maps with fractiona

conducted by Kumar Verma et al.[20]. The idea of text with the condition that it should satistfy the characteristics
encryption was also recently conducted by Charalampidis in (4). This leads to a set of linear algebraic equations
et al. using a new logistic map that they developed[21]. satisfied by the coefficients ak . The symmetry of the
function about x = 12 gives the possibility to generate the
However, in spite of these advances, dynamic lookup number of equations equal to the number of unknows ak .
table cryptosystems based on present logistic maps are Thus solving the set of algebraic equations, one obtains
not resistant to chosen and known plaintext attacks[22], the mathematical expressions of the polynomial f(x)
and simple logistic maps are not very well adapted to which can be rescaled in order to have the same first
secure communication[23]. Research investigations are terms of the classical logistic equation or also the rescale
therefore conducted with the aim to use more generalized of the value of the control parameter r. For instance, Table
logistic maps[5, 24, 25, 26], or fractional maps[26, 27] 1 presents the expressions of f (x) for N = 2, 3 and 4. For
since the addition of an extra parameter allows to increase
the number of keys. From the point of view of N f (x) Discrete polynomial
cryptography based on chaos theory, the increase of logistic equation
parameters allows the setup of more robust 2 x(1 − x).This is the xn+1 = rxn (1 − xn )
algorithms[28]. Moreover, the generalized and the classical logistic map
fractional models can be developed using the properties equation
1 1 2 1 3
of the classical logistic maps. This will facilitate their 3 4x− 8x − 8x xn+1 = 4r xn (1 − 12 xn − β xn2 )
4 8 3 4 4
integration into cryptography applications[29, 30]. 4 5 x − 5 x + 5x xn+1 = 45 rxn (1 − 2x2 + x3 )
The aim of this work is to propose new fractional
generalized discrete logistic maps starting from the
characteristic conditions of the classical logistic the case N = 3, we have also introduced a new controlling
sequences and then use the new map to put in place a new parameter α which will also has impact on the bifurcation
algorithm for text cryptography. Section 2 presents the diagrams (β = 0.5) for the actual development). This can
generalized maps or the polynomial discrete maps which also be done for the case of N = 4 in order to increase the
have the same boundaries and maximal curve properties number of parameters of the system.
as the classical logistic map. Section 3 presents the Figure 1 presents the chaotic sequences generated by the
discrete polynomial fractional maps and their bifurcation three polynomial logistic equations with the initial
diagrams. In Section 4, a text encryption scheme is conditions x0 = 0.110 and x0 = 0.11. One finds that the
presented based on the transformation of text into its three discrete equations generate chaotic discrete values
ASCII images which are then transformed into the belonging in the interval [0, 1].
correspondent numbers in the interval[0, 1]. Then the
discrete chaotic sequence whose values are enclosed in
the interval [0, 1] are used to encrypt the text. The
decryption stage follows the inverse scheme of the
encryption. Finally, in the last section, the conclusion is
presented.

2 Derivation of the polynomial discrete map

and its chaotic behavior
To develop the new polynomial discrete equations, we use
the properties of the classical logistic map. We take the
map to have the following mathematical form
xn+1 = r f (xn ), (3) Fig. 1: Chaotic discrete sequences generated by the
For the classical logistic map, one has f (xn ) = xn (1 − xn ) polynomial logistic equations and the sensitivity to initial
and the following properties are known: conditions for x0 = 0.110 and x0 = 0.11 for (a) classical
model withr = 3.7, (b) third order polynomial model (with
0 1 1 1
f ( ) = 0, f ( ) = , f (1) = 0, f (0) = 0 (4) β = 0.5 and r = 11.7) and (c) fourth order polynomial
2 2 4 model with r = 3.5
f (xn ) is symmetric about x = 12 In order to have a more general characterization of the
To obtain the polynomial or generalized maps based on the polynomial discrete maps, bifurcation diagrams with the
logistic map, we have taken corresponding Lyapunov exponent have been plotted in
Figure 2. For the three equations, the transition to chaos is
N
through period-doubling sequence. In the classical model,
f (xn ) = ∑ ak xnk , (5)
chaos is observed from r = 3.58 to r = 4. After r = 4, an
k=1

c 2013 NSP
Natural Sciences Publishing Cor.
Appl. Math. Inf. Sci. 7, No. ?, 1-8 (2013) / www.naturalspublishing.com/Journals.asp 3

explosion occurs. For the third polynomial model, chaos

is observed from r = 10.5 to r = 12.5. Explosion occurs
after r = 12.5. And for the fourth polynomial model, one
observes that chaos appears at r = 3.58 and remains till
r = 4 where the explosion takes place. Let us however
mention that in the chaos domain, there are some short
intervals given place to periodic dynamics. It is also
interesting to note that the Hopf bifurcation takes place at
r=1 for the three models and the first period-doubling
bifurcation takes place at r = 3 for the classical model, at
r = 9.8 for the third order polynomial model and at r = 3
for the fourth order polynomial model.
Fig. 3: Bifuraction diagram in the (r, β )plane for the third
For the case N = 3, we have looked for chaos in the order discrete logistic map. The shaded area corresponds
plane (r, β ). Figure 3 presents what was found. The to the domain where a couple (r, β ) leads to chaotic
shaded area indicates where the couples of parameters discrete sequences while the white area corresponds to
(r, β ) lead to chaos while the white area correspond to the periodic states
domain where the discrete map generates periodic
sequences and fixed values. This is obtained by using the
positivity of the Lyapunov exponent. In the shaded area, 3 Fractional order polynomial discrete map
some small isles of periodic behavhiors are present,
appearing in a sort of concentric lines. It is also To obtain the polynomial sequences of fractional order,
interesting to note that shade area presents several tails, we use the Grnwald-Letnikov difference of fractional
some of which are long. Moreover, one also finds that the order given by the relation [31]
shaded area hars an arc disk shape. n  
α j α
∆ x(n) = ∑ (−1) x(n − j) (6)
j=0 j

where ∆ α is fractional order difference, αR is the

fractional order and its expansion gives
n+1  
α j α
∆ x(n+1) = x(n+1)−αx(n)+ ∑ (−1) x(n− j +1)
j=2 j
(7)
To simplify the equation7, we denote m = j − 1 and the
equation becomes[32]
n  
α m+1 α
∆ x(n+1) = x(n+1)−αx(n)+ ∑ (−1) x(n−m)
m=1 m+1
(8)
By fixing Cm = (−1)m+1 m+1 α

, we obtain the
following fractional order difference expression:

n
∆ α x(n + 1) = x(n + 1) − αx(n) + ∑ Cm x(n − m) (9)
m=1

To have the fractional derivative of a discrete

equation, we first need to define the integer difference of
the same equation. Let us thus consider the discrete
system of integer order defined by the following
equation(10)

x(n + 1) = f (x(n)). (10)

where f is a nonlinear function
Fig. 2: Bifurcation diagrams and Lyapunov exponents as The difference of order 1 of the discrete system defined by
a function of r of the classical logistic sequence(a), the relation 10 is given by:
third order polynomial model (b) and the fourth order
polynomial model(c) ∆ 1 x(n + 1) = x(n + 1) − x(n) = f (x(n)) − x(n) (11)

c 2013 NSP
Natural Sciences Publishing Cor.
4 Z.Kalsouabe,M.H.Ahamat,Y.K.Mahamoud and P.Woafo: Chaos in new polynomial discrete logistic maps with fractiona

We can thus just operate the fractional derivative of

equation 11 by replacing ∆ 1 by ∆ α [31, 33] to obtain the
following equation 12:

∆ α x(n + 1) = f (x(n)) − x(n) (12)

Then from equation (9), equation (12) leads to the

following general equation(13 giving x(n + 1) when the
fractional order derivative is applied.

n
x(n + 1) = f (x(n)) + (α − 1)x(n) + ∑ Cm x(n − m) (13)
m=1

As the number of iterations increases, Cm decreases

in value. This situation poses the problem of Fig. 4: Bifurcation diagram of the fractional polynomial
computational efficiency, the space required for each map N=3 for α = 0.97(a) and α = 1(b)
iteration and the storage of all the states of the system
[33]. The solution to this problem is to use a finite
In the same order, we plot the bifurcation of the
truncation to approximate a discrete-time system of
fractional N=4 model when α = 0.98 (Figure5a) and
fractional order. The length of the truncation is denoted
α = 1 (Figure5b). For both cases, the factional order
by L, which represents the size of the considered memory
system exhibits a Hopf bifurcation when r=1 and a period
of the system [34]. Applying this principle to equation
doubling when r =2.3 for α = 0.98 and r = 2.4 for α = 1.
(13), we obtain the following approximation.
The fractional map α = 0.98 produces a chaotic behavior
with a periodic window from r = 2.7 to3.2. For α = 1, we
observe a chaotic behavior with a periodic window from
L r = 2.6 to3.2. Thus the fractional order modifies the
x(n + 1) = f (x(n)) + (α − 1)x(n) + ∑ Cm x(n − m) (14) values of r for the bifurcation points.
m=1

By applying this formula to the discrete systems

defined in Table 1 for N = 3 and N = 4, we obtain the
polynomial sequences of fractional order recorded in
Table 2.

N Fractional order discrete polynomial logistic equation

3 x(n + 1) = 4r x(n)(1 − 21 x(n) − β x(n)2 ) + (α − 1)x(n) +
∑Lm=1 Cm x(n − m)
4 x(n + 1) = 45 rx(n)(1 − 2x(n)2 + x(n)3 ) + (α − 1)x(n) +
∑Lm=1 Cm x(n − m)

Figure 4 illustrates the behavior of the proposed

fractional order polynomial sequences for N=3. From the
bifurcation diagram (Figure 4 a), it is observed that the
sequence withα = 0.97 and β = 0.5 exhibits a
period-doubling bifurcation and chaotic behavior for the
range r = 10.7 to 12. Figure 4 b shows that the model
with α = 0.97 and β = 0.5 exhibits a chaotic behavior
through a period-doubling bifurcation with one of
periodic windows from r = 10.5 to 12.1.

c 2013 NSP
Natural Sciences Publishing Cor.
Appl. Math. Inf. Sci. 7, No. ?, 1-8 (2013) / www.naturalspublishing.com/Journals.asp 5

Fig. 5: Bifurcation diagram a of the fractional polynomial

map N=4 for α = 0.98(a) and α = 1(b) –The encryption keys are randomly generated by
iterating n times the fractional generalized logistic
To analyze more the effects of the fractional order, we
sequence; n being the length of the plaintext message.
have considered the fractional order as a bifurcation
This gives a set of disordered values included in the
parameter and plot the bifurcation of the two models as
interval [0,1];
shown in Figure 6 when r = 10.8 for N = 3 and r = 2.9
–The product term by term of the encryption keys with
for N = 4 . We observe that the fractional system has a
the values of the plaintext messages in the interval
period-doubling bifurcation when the fractional order
[0,1] is then made to obtain the encrypted message.
coefficent varies. For the case N = 3, chaos appears when
the fractional order coefficient is greater that 0.95 while
for N=4, chaos is present when the fractional order
coefficient is greated than 0.5. The multiple keys of such a text encryption can be
seen as being the following: the transformation of the
ASCII in the interval [0,1], the initial conditions, the
control parameters r and ?, the choice of the interval of
iteration to obtain the n chaotic digits, the multiplication
operation.
Figure 7 summarizes the main steps of the encryption
algorithm in a flowchart.

Fig. 6: Bifurcation diagram versus ? for the fractional

polynomial logistic maps forN = 3 (a) and N = 4(b)

4 Text Cryptography
In this section, we propose a text encryption algorithm
based on three stages: conversion of the ASCII table in a
table having values belonging to the interval [0,1];
transformation of a given message to its correspondence
in this interval; mixing of the message with the chaotic
sequence generated by the polynomial logistic map. We
use here the third order polynomial model having the
parameter β as another key. More details are given below.

4.1 Presentation of the encryption algorithm

As we indicated above, a new table of correspondence has
been built between the text characters and the numerical
values included in the interval [0,1] as the first step of the
Fig. 7: Flowchart of the encryption process
encryption process and then encrypt the clear message by
the chaotic keys randomly generated. The different steps
of the algorithm are as follows:
–First, the ASCII value of each character, digit, and Text decryption is nothing else than the reverse
punctuation is divided by 256 leading to a new table. operation of encryption. The symbols of the encrypted
The ASCII value of each character using dedicated message are sequentially divided by the successive
software (some of which are free online) ; chaotic digits. The obtained values are then indexed in the
–The plaintext message is converted to ASCII in the correspondence table between the characters and the
interval [0,1] by a simple set of indexing each values included in [0,1], to display the corresponding
character in the previously established characters. Figure 8 presents the flowchart of the
correspondence table ; decryption process.

c 2013 NSP
Natural Sciences Publishing Cor.
6 Z.Kalsouabe,M.H.Ahamat,Y.K.Mahamoud and P.Woafo: Chaos in new polynomial discrete logistic maps with fractiona

0.39453125, 0.44921875, 0.00390625, 0.453125,

0.43359375, 0.00390625,
0.453125,0.40625,0.39453125,0.00390625, 0.45703125,
0.37890625, 0.4453125, 0.41796875, 0.39453125,
0.453125.
Using the following keys r = 11.56 ,x0 = 0.01,α = 0.99,
β = 0.75, and undertaken the multiplication process with
the M=24 discrete chaotic sequence starting at n=0 to 23,
the encrypted message in the [0; 1] is:
0.008648463291015625,0.037408439951648165,
0.09609020968270764,0.23575723725122075
,0.37303505612065113,0.001231495973435834,
0.2814690015711633,0.24822621966665498,0
.3054537274040361,0.16416555772221364
,0.002958487147591067,0.18953714714160258,0.34
57470436658256,0.0011199901504932868,
0.29848984310723037,0.2669627762410615,0.260
41263578565954,0.0025574499897102806,
0.30367036184768254,0.24495587257470722,0.30
22670654248385,0.25832219885483165,
0.2850445231469722,0.2339405893224883.
We remind that M=24 is the length of the message to be
encrypted. Now undertaking the decryption process, the
message received in the interval [0,1] is equal to the
original message. Finally by using the correspondence
between the interval [0,1] and the ASCII table, one
obtains the good message in the ASCII format and finally
the original message.

An interesting point was to find the correlation

Fig. 8: Flowchart of the decryption process between the message transformed in the interval [0;1] and
its encrypted correspondence in the same interval. We
The principle of the presented algorithm is close to
find a correlation value equal to 0.241.
that of Baptista’s algorithm at the level of character
Example 2: The second example we took is the text
matching with ASCII and interval division. In the
qwerty . The ASCII transformation is 113, 119, 101, 114,
Baptista’s method, the interval [0,1] is divided into S
−Xmin 116, 121.
subintervals of step ε where ε = Xmax256 and Xmax , Xmin Its correspondence in the [0,1] interval is:
the portion where the probability density is strong. The S 0.44140625, 0.46484375, 0.39453125, 0.4453125,
characters in the text are associated to the corresponding 0.453125, 0.47265625.
subintervals by iterating the logistic sequence with the Its encrypted version is:
requirement the message to be encrypted belongs to the 0.012604067451171876,0.037527224030407764,
interval: [Xmin + εk ∗ p, Xmin + εk ∗ (p + 1)],p is the ASCII 0.08727519256290914, 0.24107307073924983,
value. At the end the encrypted message corresponds to 0.358711830064727, 0.1440712148331051.
the number of iterations M performed in the logistic The decryption process also leads to the original message.
equation[16].

5 V. CONCLUSION
4.2 Examples of encrypted and decrypted
messages with correlation test In this work, we have proposed polynomial discrete maps
derived from the classical logistic map with the
Example 1: requirements that the polynomial functions satisfy the
The first example of the message encrypted is boundary values and the symmetry of the classical
?Mummy goes to the market?. Its equivalent in the ASCII logistic one. We have limited the expansion to polynomial
table is: 77, 117, 109, 109, 121, 32, 103, 111, 101, 115, of the fourth order. But the extension can be conducted
32, 116, 111, 32, 116, 104, 101, 32, 109, 97, 114, 107, for high order polynomials. The new polynomial discrete
101, 116. Its correspondence in the interval [0,1] is: maps have shown transition to chaos in the same manner
0.30078125, 0.45703125, 0.42578125, 0.42578125, as the classical one with however different values for the
0.47265625, 0.00390625, 0.40234375, 0.43359375, bifurcation points. New control parameters can be

c 2013 NSP
Natural Sciences Publishing Cor.
Appl. Math. Inf. Sci. 7, No. ?, 1-8 (2013) / www.naturalspublishing.com/Journals.asp 7

introduced as the coefficients of each term of the [12] G.Makris , L.Antoniou, Cryptography with Chaos,Chaotic
polynomials as we did for the third order polynomial. Modeling and Simulation (CMSIM)1 ,169−178(2013).
One of the new fractional discrete polynomial maps [13] R.M .May,,Simple mathematical models with very
has been used to propose a new text encryption scheme complicated dynamics, Nature261,459−467(1976).
based on three stages. The first consists of converting the [14] P.F.Verhulst ,Notice sur la loi que la population suit dans son
ASCII table into a table of values belonging to the accroissement, Correspondence Mathematique et Physique
(Ghent)10 ,113−121(1838).
interval [0,1]. The second stage converts any text from its
[15] N.Bacar,Verhulst and the logistic equation (1838). In:
equivalent to its equivalent in the interval [0,1]. Then in A Short History of Mathematical Population Dynamics.
the third stage, the message is multiplied by chaotic Springer, London,35−39(2011).
sequences of number generated from the logistic (with a [16] M.S. Baptista ,Cryptography with chaos,Physics Letters
size equal to the length of the text message). The number A240 ,50−54(1998).
of keys gives some security for the encryption scheme. [17] W.Wong, L.Lee, K.Wong,A modified chaotic cryptographic
The chaos generated by the new polynomial logistic maps method,Computer Physics Communications 138(3)),
could be used for the encryption of other types of 234−236(2001).
messages such as images and audio-videos messages, [18] O.Datcu, R.Hobincu, M.Stanciu, R .A.Badea, Encrypting
using the encryption scheme presented here or other Multimedia Data Using Modified Baptista?s Chaos-
chaos cryptography methods. Based Algorithm, In: Future Access Enablers for
The authors are grateful to the anonymous referee for a Ubiquitous and Intelligent Infrastructures. Ed. by Springer,
careful checking of the details and for helpful comments Cham.,185−190(2018).
[19] D.Xiao, X.Liao , K.Wong, Improving the Security of a
that improved this paper.
Dynamic Look-Up Table Based Chaotic Cryptosystem,IEEE
The authors are grateful to the anonymous referee for a
Transactions on Circuits and Systems 53,502−506(2006).
careful checking of the details and for helpful comments [20] D.K.Verma, M.Rani, R.K.Tyagi, B.B Sagar, Baptista
that improved this paper. chaotic cryptosystem based on alternate superior dynamic
lookup table,Journal of Discrete Mathematical Sciences and
Cryptography 22(8),1383−1392(2019).
References [21] N.Charalampidis, C.Volos, L.Moysis, A.V.Tutueva,
D.Butusov, I.Stouboulos, Text Encryption Based on a Novel
[1] Federal Information Processing Standards Publication. Data One-Dimensional Piecewise Chaotic Map, 2022 Conference
Encryption Standard (DES). NIST 46 (1999). of Russian Young Researchers in Electrical and Electronic
[2] Federal Information Processing Standards Publication. Engineering (ElConRus), 263−268(2022).
Advanced Encryption Standard (AES). NIST 197 (2001). [22] J.K.Pal,Administering a cryptology centre by means of
[3] R .L. Rivest ,A. Shamir ,L.M. Adleman , Method for scientometric indicators, Collnet Journal of Scientometrics
Obtaining Digital Signatures and Public-Key Cryptosystems, and Information Management10(1),97−123(2016).
[23] D.Arroyo, G.Alverez, V.Fernandez,On the inadequacy
Communications of the ACM 2,120−126(1978).
of the logistic map for cryptographic applications.
[4] G.Gong,K.C. Gupta, M.Hell, Y.Nawaz, Towards a General
arXiv:0805.4355v1[nlin.CD] 28 May 2008.
RC4-Like Keystream Generator, Lecture Notes in Computer
[24] M.Stavroulaki,D.Sotiropoulos, The Energy of Generalized
Science,162−174(2005).
Logistic Maps at Full Chaos, Chaotic Modeling and
[5] A. G.Radwan , On some generalized discrete logistic maps,
Simulation (CMSIM)2 ,543−550(2012).
Journal of Advanced Research 4(2),163−171(2013) [25] W.Xingyuan, L. Yanpei, A new one-dimensional chaotic
[6] R. R. Kumar ,R. Pandian , T.Prem Jacob, A.Pravin ,P. system with applications in image encryption, Chaos,
Indumathi , Cryptography Using Multiple Chaos, Journal of Solitons and Fractals 139,(2020).
Physics: Conference Series 1770(012092) (2021). [26] Z.Ying-Qian, H.Jun-Ling, W.Xing-Yuan W,An Efficient
[7] R. R. Kumar ,R. Pandian , T.Prem Jacob, A.Pravin Image Encryption Scheme Based on S-Boxes and
,P. Indumathi, Cryptography Using Chaos in Fractional-Order Differential Logistic Map, IEEE
Communication Systems. Journal of Physics: Conference Access,8(202),54175−54188(2020).
Series1770(012095)(2021). [27] V.Sangavi, P.Thangavel, An Image Encryption Algorithm
[8] N.K.Pareek , Vinod Patidar ,K. K, Sud,Cryptography using Based On Fractal Geometry, Procedia Computer Science,
multiple one-dimensional chaotic maps. Communications 165,462−469(2019).
in Nonlinear Science and Numerical Simulation10 [28] S.K,Abd-El-Hafiz, A.G.Radwan, S.H.AbdEl-
(7),715−723(2005). Haleem , Encryption Applications of a Generalized
[9] T.Xiang,K.Wong, Xiaofeng, X.Liao, An improved Chaotic Map,Applied Mathematics and Information
chaotic cryptosystem with external key, Sciences9(6),3215−3233(2015).
Communications in Nonlinear Science and Numerical [29] M.Lawnik, Generalized logistic map and its application
Simulation13(9),1879−1887(2008). in chaos-based cryptography,Journal of Physics Conference
[10] G.B West, J.H Brown, and B.J Enquist,Nature 413, 628-631 Series 936(012017),(2017).
(2001). [30] H.Natiq, N.M.G.Al-Saidi, S.J.Obaiys, M.N. Mahdi,
[11] S.Agarwal ,Chaotic Dynamics of Complex Logistic Map A.K. Farhan, Image Encryption Based on Local
in I-Superior Orbi. International Journal of Information Fractional Derivative Complex Logistic Map, Symmetry,
Technology and Computer Science 12 (4) ,11−18 (2020). 14(9),1874(2022).

c 2013 NSP
Natural Sciences Publishing Cor.
8 Z.Kalsouabe,M.H.Ahamat,Y.K.Mahamoud and P.Woafo: Chaos in new polynomial discrete logistic maps with fractiona

[31] A.A.Kilbas, H.M,Srivastava, J.J.Trujillo, J.J,Theory and

Applications of Fractional Differential Equations, Elsevier B
V, Amsterdam, (2006)
[32] O.Megherbi, H.Hamiche, S.Djennoune, M.Bettayeb,A
new contribution for the impulsive synchronization of
fractional-order discrete-time chaotic systems, Nonlinear
Dynamics,90,1519−1533(2017).
[33] A.A.Khennaoui, A.Ouannas, S.Momani,
O.A.Almatroud, M.M.Al-Sawalha MM, Boulaaras,
V.T. Pham, Special Fractional-Order Map and Its
Realization,Mathematics,10(23)4474(2022).
[34] X. Liao, Z. Gao, H. Huang,Synchronization control of
fractional-order discrete-time chaotic systems; In : European
Control Conference (ECC), Zrich, Switzerland, (2013)

c 2013 NSP
Natural Sciences Publishing Cor.