Abstract
Local fractional calculus (fractal calculus) plays a crucial role in applications, especially in computer sciences and engineering. One of these applications appears in the theory of chaos. Therefore, this paper studies the dynamics of a fractal complex logistic map and then employs this map to generate chaotic sequences for a new symmetric image encryption algorithm. Firstly, we derive the fractional complex logistic map and investigate its dynamics by determining its equilibria, geometric properties, and chaotic behavior. Secondly, the fractional chaotic sequences of the proposed map are employed to scramble and alter image pixels to increase resistance to decryption attacks. The output findings indicate that the proposed algorithm based on fractional complex logistic maps could effectively encrypt various kinds of images. Furthermore, it has better security performance than several existing algorithms.
1. Introduction
Advancements in communications and computer technologies facilitate data transmission over internet networks. However, the main issues of data transmission over the internet are the safety of the information from unauthorized users. Recently, image encryption, which aims to keep information secret, has attracted researchers from various fields [1]. In the encryption and decryption processes, security keys are an integral part. The security keys are used to convert the data to nonsense data and vice versa; thus, security keys should be shared to recover the original image [2].
The process of image encryption and decryption is based on mathematical models, which are used to encrypt images using multi-secret keys [3]. Many encryption models have been proposed. The most known image encryption algorithms are based on chaotic encryption [4,5,6]. Over the years, chaos theory has been applied in science and engineering [7,8]. It especially received much attention in the area of image encryption.
T. Gopalakrishnan and S. Ramakrishnan [9] presented an image encryption method given by multiple chaotic maps. The method utilizes various keys for four-round encryption cycles. The method can be employed to encrypt grayscale images and color images. Y. Luo, et al. [10] demonstrated how a grouping of a Baker map and a logistic map can be used as a two-dimensional chaotic system that can encrypt images. Li et al. [11] designed an encryption system that uses key streams depending on the input image. The system employs a chaotic system and hash function to achieve its goals. Nestor Tsafack et al. [12] published a novel image encryption method that is formulated by a new chaotic map with dynamic analysis for the health internet of things.
Fractal calculus [13,14,15] (local fractional calculus) plays a major role in wide fields of science and engineering such as geology, economics, chemical physics, control theory, and fluid flow [16,17]. Fractal calculus has been utilized to generalize chaotic systems, chaotic maps, optimization, operation, and other theories of chaos [18,19,20,21,22]. Chaos is an extensive stimulating occurrence in nonlinear dynamical systems, which has been widely investigated through the recent period. Different researchers have proposed various new chaotic maps that have more security [23,24]. Additionally, cryptographic algorithms utilize common chaotic models such as logistic maps [25]. G. Zhang et al. [26] proposed a new chaotic logistic map called tent delay-sine cascade (TDSCL) for image encryption. The algorithm of this image encryption achieves confusion and diffusion. Y. Zhang et al. [27] proposed a new fractional-order logistic map based on S-boxes. The proposed fractional-order chaotic system provided a larger key space to make the image encryption more efficient against crypto-analytic attacks. The proposed S-boxes were used for the encryption confusion process.
Fractal calculus models are now widely used in image security due to their infinite boundaries property [28]. Sangavi and Thangavel [29] proposed an image encryption algorithm that employs fractal geometry of colored images. This proposed image encryption algorithm has a large key space with complex behavior to produce the confusion behavior. The confusion behavior of the proposed model helps to shuffle the image’s pixel positions to avoid correlation between image pixels.
This paper studies the dynamics of a new fractal complex logistic (FCL) map and then investigates its performance as an essential seed for image encryption algorithms. Firstly, the dynamical characteristics of the FCL, including the equilibrium point, the geometric properties, and chaotic behaviors, are discovered. Simulation analysis proves that the FCL generates wider chaotic regions and ensures the pseudo-randomness of this map. Secondly, to demonstrate the efficiency of the FCL map in real applications, we employ it in an image encryption algorithm. In this algorithm, the fractal complex sequences of the FCL are used to alter the image’s pixels to drastically increase the resistance to decryption attacks. The output findings indicate that our proposed algorithm could effectively encrypt various kinds of images with a high level of security performance.
The rest of this paper is organized as follows: Section 2 introduces the fractal complex logistic map and then defines its structure, fixed points, and geometric properties. Furthermore, this section proposes a new encryption algorithm to demonstrate the efficiency of the map. Section 3 analyzes the performance of the proposed encryption algorithm. Finally, the conclusions are presented in Section 4.
2. Materials and Methods
The proposed mathematical FCL map model that is used for the image encryption algorithm is given as follows [13,14,15]:
2.1. Fractal Complex Logistic (FCL) Map
Let be a fractal set and let For and ; the limit
is finite and exists. Here, the gamma function is defined as .
Note that
The 2D-fractal derivative is suggested for a complex function , where expressing on a fractal set of (the complex plane), as follows [30]:
where the difference operator is formulated by
For instance, has a fractal derivative
Hence, generally, for an analytic function f in a complex domain, we obtain the construction of a fractal derivative, as follows Theorem 9 [30]:
where f is located in some fractal set.
The fractal integral can be recognized by the discrete formula
where
Proposition 1.
Consider the fractal equation
Then, the solution becomes as follows
2.2. Structure of FCL Map
By using the difference fractal operator, we proceed to define the FCL map. A complex logistic map is given by the structure
where ℵ is the control parameter. However, the above discrete complex logistic map can be converted to the continuous type, as follows:
By considering, we have the system
By considering the discrete fractal operator, we have the following FCL map,
Consequently, we obtain the FCL map
which corresponds to the dynamic system
It is clear that when System (16) reduces to System (12).
2.3. Properties of FCL Map
2.3.1. Equilibrium Points
Consider the following two equations
Now, we have the following set
The Jacobian matrix becomes
Note that
which leads to two equal Eigenvalues
Now, we obtain the equilibrium points of System (14) by resolving the next system
The set of solutions is formulated as follows:
where
2.3.2. Geometric Properties
Consider an FCL map that is defined on a fractal set of the open unit disk := To study the geometric properties of the FCL map, we need the following definition:
Definition 1.
Two analytic functions, , are subordinated in U denoted by if they occur as the function satisfying . They are majorized if , which is equivalent to where and are the coefficients of f and g, respectively.
The following shows the geometric behavior of the logistic map and the FCL map in terms of the limacon map .
Proposition 2.
Consider the logistic mapand its fractal the FCL mapwhere
- 1.
- Ifthen
- 2.
- Ifthen
Proof.
Clearly, we have
which is the starlike analytic function in whenever (see [22]). Utilizing the first condition of the theorem, we obtain
Similarly, the second condition implies that
Since in view of Corollary 2 [31], we obtain the first assertion
In the same manner, we obtain the second inequality
The geometry of the logistic map and the fractal logistic map is dominated by a starlike function in the open unit disk Note that the analytic function is called starlike if and only if . Proposition 2 yields a relation between the derivative of the logistic map (normal and fractal) and the second derivative of the limacon map, which represents to the convexity behavior the map following Theorem 3 [31]:
and
□
2.4. The FCL Map Algorithm
From Proposition 1, we use Equation (14) to obtain
where It is clear that the map depends on the previous information, since there is a fractional kernel
Figure 1 illustrates the behavior of the proposed FCL map by depicting its bifurcation diagram. From the bifurcation diagram (Figure 1a), it is obvious that the system with shows a period-doubling bifurcation with a complete absence of chaotic behavior for the range of . Meanwhile, Figure 1b shows that the system with enters into chaotic behavior by period-doubling bifurcation with a complete absence of periodic windows, mainly where .
Figure 1.
Bifurcation diagram of the FCL map with the initial value : (a) = 0.5; (b) = 0.6.
Furthermore, Figure 2 illustrates the randomness of chaotic sequences of the FCL map by using the statistical package NIST SP800-22, which contains 16 empirical tests. Here, a binary sequence has been taken from the FCL map with a length of 1,000,000 bits to employ as the testing input. The sequence can be considered as random when the obtained p-value is larger than 0.01. As can be seen in Figure 2a,b, the chaotic sequence generated by the FCL map can pass all the sub-tests. That means this map is suitable for image encryption algorithms.
2.5. The Encryption Method
The steps for symmetric image encryption by the proposed method are as follows:
- 1.
- Read the input image (I), and convert the values to a 52-bit binary stream using IEEE 754 float standard; then, the digital numbers from 33rd to 40th in each binary stream are used;
- 2.
- Set the secret key, which is mainly generated from the initial value and control parameters of the FCL map, as illustrated in Figure 3;Figure 3. The secret key structure, which consists of five parts with 232 bits.
- 3.
- Use proposed FCL to generate the chaotic sequences . Note that for all ;
- 4.
- Start the confusion of the input image by changing the position of pixels by using conditional shift, which stops the algorithm for any shifting cases to make the variable z outside the open unit disk;
- 5.
- Convert the chaotic sequences to binary numbers using IEEE 754 float standard in which each chaotic output produces eight binary numbers;
- 6.
- Start the diffusion of the confusing image to obtain the encrypted image by using the XOR operation between the binary input image and the binary form of chaotic sequence as: I(i) = bitxor (Ib(i),(z(i));
- 7.
- Convert I into a two-dimensional encrypted image (Ie);
- 8.
- The previous steps are applied in reverse to decrypt the image.
The bifurcation diagram is used to illustrate the behavior of the proposed chaotic maps through the distribution of iterates z versus the control parameter ℵ. Essentially, the FCL map can be governed by two parameters (z and ℵ), and the map has a random behavior that is represented by an alteration in the values of either or both of the aforementioned parameters (z and ℵ). The key idea of applying the FCL map in image encryption is based on a repetition function in which the previous output value of z will influence the current value of zn.
Figure 2.
The NIST SP800-22 result: (a,b) represent the statistical sub-tests of the chaotic sequence generated by FCL map with the initial value and the parameters = 0.6 and .
3. Results
Here, the performance of the proposed image encryption model with the initial value and the parameters = 0.6 and is demonstrated using standard test images, commonly known as Barbara, sketch, handwriting, and Lena, with the size . We employed statistical analyses to assess the model’s performance. The experiments were undertaken using MATLAB R2021a with Windows 10, 8.00 GB RAM, Intel(R) Core (TM) i7-6700HQ CPU @2.60 GHz.
3.1. Encrypting Different Kinds of Images
To demonstrate the ability of the proposed symmetric image encryption algorithm for ciphering different types of images, Figure 4 depicts the encryption results with uniformly distributed histograms of various kinds of images. The first column depicts the animal sketches, handwriting, and Lena images. The second column plots the histograms of these images. Meanwhile, the third column plots the encryption of the animal sketches, the handwriting, and Lena images, respectively. Finally, the fourth column depicts histograms of the encrypted images. It can be seen from these results that the proposed encryption algorithm can effectively encrypt various kinds of images.
Figure 4.
Simulation results of the proposed encryption model: (a,e,i) are the plain-text images; (b,f,j) are the histogram of the plain-text images; (c,g,k) are the encrypted images; (d,h,l) are the histogram of the encrypted images.
3.2. Information Entropy Analysis
The entropy measures the degree of n predictability of information. The information entropy is calculated for encrypted images to measure the degree of uncertainty; however, any certain degree of predictability will threaten the encryption security [32]. Table 1 is an assessment of the data entropy of the plaintext and the encrypted image for the suggested FCL map model.
Table 1.
Comparison of information entropy between plain and encrypted images.
Table 2 illustrates the comparison of information entropy of several algorithms using Lena as a test image. As can be seen, the encrypted image produced by our FCL map algorithm is close to the value of 8, which indicates that the chaotic sequences generated by the proposed FCL map model have complex dynamic behaviors.
Table 2.
Comparison of data entropy of various encryption procedures utilizing Lena.
3.3. Correlation Analysis
The aim of image encryption algorithms is to decrease the correlation among the image pixels in order to make the prediction of any given pixel from its neighbors more difficult. The correlation between two adjacent pixels can be calculated by Equation (33) [12]:
where S, T are pixel values of two adjacent pixel positions and n is the total number of adjacent pixels, where
Table 3 demonstrates the correlation coefficients of the original and encrypted images. The calculated correlation coefficients illustrate that the correlation coefficients of the encrypted images are close to zero, which proves that the FCL map of the proposed model can effectively decrease the correlation among adjacent pixels of the original images.
Table 3.
The correlation between plain and encrypted images. Horizontal (H), vertical (V), and diagonal (D) indicate the correlation directions.
Taking the average values for testing images as an experimental object, the comparison of correlation between different encryption algorithms in the horizontal (H), vertical (V), and diagonal (D) directions are illustrated in Table 4.
Table 4.
Comparison of the encryption time (second), and the correlation of different encryption algorithms using average values for testing images. Horizontal (H), vertical (V), and diagonal (D) indicate the correlation directions.
The encryption time is used to measure the efficiency of the encryption algorithm and it depends on certain parameters such as CPU cycles and memory usage. The image encryption time of the proposed algorithm is the time that it takes to encrypt the input image using proposed algorithm. In this study, the average encryption time of test images was measured using the stopwatch timer MATLAB functions, tic and toc.
The test results of the encryption speeds of different image encryption algorithms are also included in Table 4. Because the source codes of the encryption algorithms illustrated in Table 4 are not publicly available, all encryption times are reported in Table 4 according to what is given by these references. The proposed FCL map model has the fastest encryption speed with the lowest time complexity, so it can be used in real-time image applications such as video stream cyphering.
3.4. Key Sensitivity Analysis
The image encryption algorithm primarily depends on the key sensitivity. Even one bit change to the key combinations can produce a different encrypted image. The proposed FCL map model is proven to be highly sensitive to changes in the encryption key. As shown in Figure 5, the model is sensitive to changes as small as one bit. As a result, if the decryption key is slightly changed, the decryption algorithm will not be able to correctly decrypt the image.
Figure 5.
Key sensitivity analysis: (a) plain-image, (b) the encrypted image, (c) the decrypted image with the right key, (d–f) the decrypted images with wrong keys.
3.5. Differential Attack Analysis
To check the ability of our encryption algorithm to resist differential attack, we use the two metrics: the NPCR and UACI, which are the abbreviations for (Number of Pixel Change Rate) and (Unified Average Changing Intensity), respectively. The NPCR indicates the changed pixel numbers in the cipher image for which only one pixel is changed in the plain image. Meanwhile, the UACI refers to the average value of difference between two cipher images. The NPCR and UACI are given by:
where , where G1 and G2 are two pixels with the same coordinates and H represents the image size. Table 5 shows the NPCR and UACI for the proposed FCL map encryption algorithm. Furthermore, the comparisons of NPCR and UACI for the “Lena” image with other algorithms are presented in Table 6. From the results shown in Table 5 and Table 6, it is clear that our encryption algorithm has superior or competitive performance in defending from differential attacks (which are also called chosen-plaintext attacks).
Table 5.
The NPCR and UACI of the proposed model for the given testing images.
Table 6.
Comparison of the NPCR and UACI for the testing image “Lena”.
3.6. Noise and Data Loss Analysis
Several types of noise and data lose can spoil the encrypted images. Therefore, image encryption algorithms should be able to resist these kinds of noise and data lose. The first and second columns of Figure 6 show the quality results of the recovered image when the encrypted image undergoes Gaussian noise with density, as well as salt and pepper noise with density. It can be observed that, although the encrypted images contain noise, the recovered images have most of the visual information of the original images.
Figure 6.
Noise and data loss analysis: (a,d) plot the encrypted image with Gaussian noise and the decrypted image, respectively; (b,e) plot the encrypted image with salt and pepper noise and the corresponding decrypted image, respectively; (c,f) plot the encrypted image with data loss and the decrypted image, respectively.
4. Conclusions
This paper studied the dynamics of a new fractal complex logistic (FCL) map, including the equilibrium point, geometric properties, and chaotic behaviors. Furthermore, the randomness of the FCL map was examined by the statistical test NIST SP800-22, which revealed that the map is suitable for cryptographical applications. To further investigate the FCL map, we designed a simple symmetric image encryption algorithm that used the FCL map to generate chaotic sequences. Simulation results demonstrated the efficiency of the encryption algorithm for the encryption of various kinds of images. We also analyzed the information entropy, correlation coefficients between adjacent pixels, the sensitivity of the key, and the resistance to chosen-plaintext attack. The analysis results show that the proposed encryption algorithm has a high-security level and has superiority over several encryption algorithms. That indicates the effectiveness of the FCL map in such applications.
Author Contributions
Conceptualization, H.N. and N.M.G.A.-S.; methodology, H.N.; software, A.K.F.; validation, H.N., N.M.G.A.-S. and, M.N.M.; formal analysis, H.N.; investigation, M.N.M.; writing—original draft preparation, H.N.; writing—review and editing, N.M.G.A.-S.; visualization, A.K.F.; supervision, S.J.O.; project administration, S.J.O.; funding acquisition, S.J.O. All authors have read and agreed to the published version of the manuscript.
Funding
This research is funded by University of Malaya International Collaboration Grant ST008-2022.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Acknowledgments
This research is funded by University of Malaya International Collaboration Grant ST008-2022(UM.0001082/HRU.OP). We thank the reviewers and associate editor for their comments which improved this manuscript.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Pourasad, Y.; Ranjbarzadeh, R.; Mardani, A. A new algorithm for digital image encryption based on chaos theory. Entropy 2021, 23, 341. [Google Scholar] [CrossRef] [Scilit] [PubMed]
- Askar, S.S.; Karawia, A.A.; Alshamrani, A. Image Encryption Algorithm Based on Chaotic Economic Model. Math. Probl. Eng. 2015, 2015, 341729. [Google Scholar] [CrossRef] [Scilit]
- Tang, Z.; Yang, Y.; Xu, S.; Yu, C.; Zhang, X. Image encryption with double spiral scans and chaotic maps. Secur. Commun. Netw. 2019, 2019, 8694678. [Google Scholar] [CrossRef] [Scilit]
- Erkan, U.; Toktas, A.; Toktas, F.; Alenezi, F. 2D eπ-map for image encryption. Inf. Sci. 2022, 589, 770–789. [Google Scholar] [CrossRef] [Scilit]
- Erkan, U.; Toktas, A.; Enginoğlu, S.; Akbacak, E.; Thanh, D.N. An image encryption scheme based on chaotic logarithmic map and key generation using deep CNN. Multimed. Tools Appl. 2022, 81, 7365–7391. [Google Scholar] [CrossRef] [Scilit]
- Toktas, A.; Erkan, U. 2D fully chaotic map for image encryption constructed through a quadruple-objective optimization via artificial bee colony algorithm. Neural Comput. Appl. 2022, 34, 4295–4319. [Google Scholar] [CrossRef] [Scilit]
- Martsenyuk, V.; Augustynek, K.; Urbas, A. On qualitative analysis of the nonstationary delayed model of coexistence of two-strain virus: Stability, bifurcation, and transition to chaos. Int. J.-Non-Linear Mech. 2021, 128, 103630. [Google Scholar] [CrossRef] [Scilit]
- Al-Saidi, N.M.; Younus, D.; Natiq, H.; Ariffin, M.R.K.; Asbullah, M.A.; Mahad, Z. A new hyperchaotic map for a secure communication scheme with an experimental realization. Symmetry 2020, 12, 1881. [Google Scholar] [CrossRef] [Scilit]
- Gopalakrishnan, T.; Ramakrishnan, S. Chaotic image encryption with hash keying as key generator. IETE J. Res. 2017, 63, 172–187. [Google Scholar] [CrossRef] [Scilit]
- Luo, Y.; Yu, J.; Lai, W.; Liu, L. A novel chaotic image encryption algorithm based on improved baker map and logistic map. Multimed. Tools Appl. 2019, 78, 22023–22043. [Google Scholar] [CrossRef] [Scilit]
- Aslam, M.N.; Belazi, A.; Kharbech, S.; Talha, M.; Xiang, W. Fourth order MCA and chaos-based image encryption scheme. IEEE Access 2019, 7, 66395–66409. [Google Scholar]
- Tsafack, N.; Sankar, S.; Abd-El-Atty, B.; Kengne, J.; Jithin, K.; Belazi, A.; Mehmood, I.; Bashir, A.K.; Song, O.-Y.; Abd El-Latif, A.A. A new chaotic map with dynamic analysis and encryption application in internet of health things. IEEE Access 2020, 8, 137731–137744. [Google Scholar] [CrossRef] [Scilit]
- Yang, X.-J. Advanced Local Fractional Calculus and Its Applications; World Science Publisher: New York, NY, USA, 2012. [Google Scholar]
- Yang, X.-J.; Baleanu, D.; Srivastava, H.M. Local Fractional Integral Transforms and Their Applications; Academic Press: Cambridge, MA, USA, 2015. [Google Scholar]
- Yang, X.-J.; Baleanu, D.; Srivastava, H. Local fractional similarity solution for the diffusion equation defined on Cantor sets. Appl. Math. Lett. 2015, 47, 54–60. [Google Scholar] [CrossRef] [Scilit]
- Kilbas, A.A.; Srivastava, H.M.; Trujillo, J.J. Theory and Applications of Fractional Differential Equations; Elsevier: Amsterdam, The Netherlands, 2006; Volume 204. [Google Scholar]
- Zhou, Y.; Wang, J.; Zhang, L. Basic Theory of Fractional Differential Equations; World Scientific: Singapore, 2016. [Google Scholar]
- Ibrahim, R.W.; Altulea, D. Controlled homeodynamic concept using a conformable calculus in artificial biological systems. Chaos Solitons Fractals 2020, 140, 110132. [Google Scholar] [CrossRef] [Scilit]
- Jalab, H.A.; Ibrahim, R.W.; Hasan, A.M.; Karim, F.K.; Al-Shamasneh, A.a.R.; Baleanu, D. A New Medical Image Enhancement Algorithm Based on Fractional Calculus. CMC-Comput. Mater. Contin. 2021, 68, 1467–1483. [Google Scholar] [CrossRef] [Scilit]
- Ibrahim, R.W. A new image.)denoising model utilizing the conformable fractional calculus for multiplicative noise. SN Appl. Sci. 2020, 2, 1–11. [Google Scholar] [CrossRef] [Scilit]
- Ramakrishnan, B.; Nkandeu Kamdeu, P.Y.; Natiq, H.; Pone, J.R.M.; Karthikeyan, A.; Kingni, S.T.; Tiedeu, A. Image encryption with a Josephson junction model embedded in FPGA. Multimed. Tools Appl. 2022, 81, 23819–23843. [Google Scholar] [CrossRef] [Scilit]
- Meshram, C.; Ibrahim, R.W.; Obaidat, M.S.; Sadoun, B.; Meshram, S.G.; Tembhurne, J.V. An effective mobile-healthcare emerging emergency medical system using conformable chaotic maps. Soft Comput. 2021, 25, 8905–8920. [Google Scholar] [CrossRef] [Scilit]
- Ji, Y.; Lai, L.; Zhong, S.; Zhang, L. Bifurcation and chaos of a new discrete fractional-order logistic map. Commun. Nonlinear Sci. Numer. Simul. 2018, 57, 352–358. [Google Scholar] [CrossRef] [Scilit]
- Natiq, H.; Al-Saidi, N.M.G.; Said, M.R.M.; Kilicman, A. A new hyperchaotic map and its application for image encryption. Eur. Phys. J. Plus 2018, 133, 6. [Google Scholar] [CrossRef] [Scilit]
- Zahmoul, R.; Ejbali, R.; Zaied, M. Image encryption based on new Beta chaotic maps. Opt. Lasers Eng. 2017, 96, 39–49. [Google Scholar] [CrossRef] [Scilit]
- Zhang, G.; Ding, W.; Li, L. Image encryption algorithm based on tent delay-sine cascade with logistic map. Symmetry 2020, 12, 355. [Google Scholar] [CrossRef] [Scilit]
- Zhang, Y.-Q.; Hao, J.-L.; Wang, X.-Y. An efficient image encryption scheme based on S-boxes and fractional-order differential logistic map. IEEE Access 2020, 8, 54175–54188. [Google Scholar] [CrossRef] [Scilit]
- Veeman, D.; Natiq, H.; Al-Saidi, N.M.; Rajagopal, K.; Jafari, S.; Hussain, I. A New Megastable Chaotic Oscillator with Blinking Oscillation terms. Complexity 2021, 2021, 5518633. [Google Scholar] [CrossRef] [Scilit]
- Sangavi, V.; Thangavel, P. An image encryption algorithm based on fractal geometry. Procedia Comput. Sci. 2019, 165, 462–469. [Google Scholar] [CrossRef] [Scilit]
- Cattani, C.; Srivastava, H.M.; Yang, X.-J. Fractional Dynamics; De Gruyter Open Poland: Berlin, Germany, 2016. [Google Scholar]
- Campbell, D.M. Majorization-subordination theorems for locally univalent functions, II. Can. J. Math. 1973, 25, 420–425. [Google Scholar] [CrossRef] [Scilit]
- Li, T.; Du, B.; Liang, X. Image encryption algorithm based on logistic and two-dimensional lorenz. IEEE Access 2020, 8, 13792–13805. [Google Scholar] [CrossRef] [Scilit]
- Wang, X.; Guo, K. A new image alternate encryption algorithm based on chaotic map. Nonlinear Dyn. 2014, 76, 1943–1950. [Google Scholar] [CrossRef] [Scilit]
- Liu, L.; Miao, S. A new image encryption algorithm based on logistic chaotic map with varying parameter. SpringerPlus 2016, 5, 1–12. [Google Scholar] [CrossRef] [Scilit]
- Zhang, F.; Zhang, X.; Cao, M.; Ma, F.; Li, Z. Characteristic Analysis of 2D Lag-Complex Logistic Map and Its Application in Image Encryption. IEEE Multimed. 2021, 28, 96–106. [Google Scholar] [CrossRef] [Scilit]
- Hua, Z.; Zhou, Y.; Pun, C.-M.; Chen, C.P. 2D Sine Logistic modulation map for image encryption. Inf. Sci. 2015, 297, 80–94. [Google Scholar] [CrossRef] [Scilit]
- Tong, X.J.; Wang, Z.; Zhang, M.; Liu, Y.; Xu, H.; Ma, J. An image encryption algorithm based on the perturbed high-dimensional chaotic map. Nonlinear Dyn. 2015, 80, 1493–1508. [Google Scholar] [CrossRef] [Scilit]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).





