Abstract
Chaotic systems have good characteristics, such as sensitivity to initial value and parameter, ergodicity, certainty and so on. Using chaos to generate pseudo-random sequences for encryption has good efficiency and security. However, due to the limitation of computing precision, the chaotic sequence running on the computer will enter a cycle after several times of iterations. In this paper, a control method is proposed to reduce this phenomenon. In this method, one chaotic map is used to adjust the parameters of another chaotic map, which makes the sequence generated by this model has good dynamic characteristics under a low computing precision. To prove the effectiveness of this model, two examples are provided. Furthermore, the dynamical performances of these two chaotic systems have been demonstrated by a series of analyses.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
1 Introduction
As a discipline emerging at the end of the last century, chaos is now used in various fields, such as computer science, physics, mathematics (Tanriverdi et al. 2021; Baskonus et al. 2022), cryptography (Liu and Miao 2017a; Li et al. 2019), economics and etc. (Lynnyk et al. 2015). In the field of cryptography, a pseudo-random number generator is needed in most of the information encryption algorithms, especially in stream-cipher. The cipher text is obtained through a series of operations between the number sequences computed by the generators and the plain-text information, which means that the performance of the generator determines the effect of encryption directly.
Chaotic systems have many excellent dynamic characteristics, such as randomness and uncertainty (Wang and Guo 2014). All these characteristics make the chaotic system suitable to be applied in cryptography, especially as a pseudo-random number generator (Kafetzis et al. 2023; Ming et al. 2023). In this era when computers are widely used as encryption machines, chaotic systems can be simulated in computers due to the advantages of simplicity and ease of implementation, and such chaotic systems are called digital chaotic systems (Teh et al. 2015; Teh and Samsudin 2017; Hua et al. 2019)..
However, due to the limitation of computing precision, the chaotic map simulated on computer will quickly fall into a cycle, which makes the generated sequence by digital chaotic systems no longer be pseudo-random. To address this problem, scholars have proposed many strategies, such as using higher computing precision (Wheeler and Matthews 1991), cascading multiple chaotic systems (Zhou et al. 2015; Hua et al. 2017; Alawida et al. 2019a), switching between multiple chaotic systems (Xiao et al. 2005; Nagaraj et al. 2008; Zhou et al. 2013; Wu et al. 2014), error compensation (Deng et al. 2015a; Hu et al. 2008), coupling chaotic system (Liu et al. 2018; Huang et al. 2019), introducing delays (Liu and Miao 2015, 2017b), combining chaotic maps using modular operation (Hu et al. 2014; Zhou et al. 2014; Deng et al. 2015b; Alawida et al. 2019b) and perturbing the chaotic system (Cao et al. 2015; Deng et al. 2015c; Wang et al. 2016; Liu et al. 2017a, 2017b; Luo et al. 2021).
(Wheeler and Matthews 1991) proposed a method to use high-precision computers. With the improvement of precision, the average period of the chaotic system trajectory will be increased. However, the improvement of computing precision will greatly add its implementation cost, and the period of system trajectory cannot be controlled. In (Hua et al. 2017), a method based on sine transformation is presented to improve the chaotic system. Users can freely select two chaotic maps as seed maps, and then combine the states generated by these two chaotic maps for sine transformation to get its output. In (Wu et al. 2014), the researchers proposed a chaotic system combined with various chaotic maps. In this chaotic framework, the seed map used in the next iteration is determined by a control sequence. Experimental performance analysis demonstrates that the dynamical characteristics can be greatly enhanced. However, the complexity of the improved system is completely determined by the control sequence. In (Deng et al. 2015a), a varying-parameter control method, which belongs to the error compensation method, is firstly proposed. It makes a great performance of chaotic behavior even the chaotic system is realized on a low computing precision computer. Based on this method, an effective pseudo-random number generator is constructed. Although the method is proven to be effective by simulation experiments, it still has some weaknesses, such as the limitation of parameter range and poor flexibility, as well as a small key space. In (Liu and Miao 2017b), a delayed chaotic state function is used to perturb the digital chaotic map. Numerical experimental results indicate that this method is quite effective. In (Zhou et al. 2014), a modular operation is used to adjust the chaotic maps to reduce the dynamical degradation.
Moreover, (Zheng and Hu 2022) introduced a novel bit shift method. According to different strategies, the current calculation result of the chaotic map is carried out through the operation of a bit cycle shift. Fan and Ding (2022) used a stochastic jump mechanism to improve such problem. Firstly, the researchers designed a chaotic cycle-finding algorithm named CCFA. Then, a stochastic jump mechanism is introduced to counteract the problem of the chaotic cycle. In (Fan and Ding 2023), the authors designed a general iterative model which can construct a polynomial chaotic map. This chaotic map has a positive Lyapunov exponent with arbitrary expectations. In addition, the author also puts forward some geometric control ideas of a polynomial chaotic map. In (Zhou et al. 2023), a novel perturbation method of generating ideal chaotic sequence is introduced, etc.
Inspired by the literature mentioned above, to reduce the dynamical degradation of digital chaotic maps, we proposed a model based on two maps in this paper. The sequence generated by one-dimensional chaotic map is used to adjust the parameters of another map. The output of one-dimensional chaotic map and other values are involved in the calculation of other chaotic map parameters to make these parameters vary randomly. In this method, the randomness of the output chaotic sequence can be greatly improved. Several experimental results prove that the improved chaotic sequence is more complex than the sequence generated by the original chaotic maps. The advantages of this method can be summarized as follows.
-
(1)
This method is easy to implement, and does not add much extra computational costs.
-
(2)
The parameters in this model are time-varied, which can make more complex dynamic characteristics.
-
(3)
The method is universal, which can be used to any digital chaotic maps.
The rest of this paper are organized as follows: Sect. 2 introduces the proposed chaotic model. Section 3 presents a chaotic system as an example based on Logistic map and Baker map. Several dynamic characteristic and security tests are provided in this section as well. Another example and its performance analysis are provided in Sect. 4. Finally, Sect. 5 concludes the whole paper.
2 A novel perturbation model for digital chaotic maps
A chaotic map will suffer dynamical degradation when it is realized on a finite precision device, such as computer. Due to the finite phase space, the time series of chaotic map will finally enter a cycle after several times of iteration. In order to solve this problem, here, we propose a parameter perturbation model to improve the performance of chaotic maps. This model can be written as follows:
where function PR(·) donate the precision function, and it can limit the time variables onto a finite phase space. \(a_{i}^{{\left( {1} \right)}} ,a_{i}^{{({2})}} , \ldots a_{i}^{(n)}\) are parameters of chaotic maps \(F_{1} ,F_{2} , \ldots F_{n}\), respectively. It should be noticed that parameter sequences \(\left\{ {a_{i}^{{({1})}} } \right\},\{ a_{i}^{{\left( {2} \right)}} \} , \ldots \left\{ {a_{i}^{(n)} } \right\}\) are different at each iteration, and it can be calculated as follows:
And sequence {wi} can be calculated as:
where G(·) is a chaotic map and μ0 is a parameter of G(·). Parameter sequences {ai(1)}, {ai(2)}, …, {ai(n)} are computed by using formula Eqs. (2) and (3). Given that control parameters are different at each iteration, system security can be significantly improved. Moreover, in Eq. (2), the parameters \(\mu_{{1}} ,\mu_{{2}} , \ldots ,\mu_{n}\) are different and we remain these parameters within a reasonable range in each iteration for different chaotic maps. In general, when one of the parameters in chaotic map Fi is at most α, we're going to take vi to be α here. The advantage of assigning vi in this way is that the parameter range is not being compressed.
Finally, set the parameter k, add the obtained sequence \(\left\{ {x_{i}^{{({1})}} } \right\},\left\{ {x_{i}^{{({2})}} } \right\}, \ldots ,\left\{ {x_{i}^{(n)} } \right\}\) and the chaotic sequence {zi} can be calculated as:
The function a mod b means to divide the value a by b and then take the remainder, which is a modular operation.
The improved chaotic map can be generated by performing the above steps. Since the parameter changes constantly with iteration, the security and the randomness of the chaotic sequence can be enhanced. Moreover, different from the chaotic system with fixed parameters, in this model, the parameters will change with iteration, which can improve the chaotic dynamic complexity and minimize the influence of the parameters on the chaotic function to the greatest extent. The chaotic maps calculating the sequence of parameters can be a simple structure chaotic map, which can improve the performance of the chaotic system without much computational cost. The flow chart of generating ideal chaotic sequence is shown in Fig. 1.
3 A logistic-baker dual chaotic system
This section introduces an example of the novel chaotic system model. This chaotic system comprises one-dimensional Logistic map and Baker map.
3.1 Original chaotic maps
3.1.1 Logistic chaotic map
The Logistic map is a classical one-dimensional chaotic map with complex dynamic behavior in a mathematical form. Its excellent performance makes it be widely used in communication and cryptography (Francois et al. 2014; Sun and Liu 2009; Hua et al. 2021; Khedmati et al. 2020). The formula of this map can be shown as:
In this formula, μ is called a logistic branch parameter, the variable x ranges from 0 to 1. Figure 2 shows the bifurcation diagram of this map. When the parameter μ ∈ (3.5699, 4], the range of x between 0 and 1 is more widely distributed, and can be regarded to be chaotic.
3.1.2 Baker chaotic map
Baker map is a two-dimensional chaotic map (Zheng et al. 2008) and the formula can be shown as:
The Baker map is an iterative equation simultaneously determined by two variables, x and y. This manner is considerably more complicated than synchronizing two independent 1D chaotic sequence generations. The control parameter range of the Baker map is a ∈ (0,1). Figure 3 shows the bifurcation diagram of the original Baker map. As we can see, when the value of a is between 0 and 1, some of the results using a particular parameter a may have fixed points so that the behavior of the sequence is not chaotic. Since the calculation of variables (x and y) of this formula is relatively independent, in this paper, we use the x-dimension of this map, which can be viewed as a one-dimensional chaotic map.
3.2 Improved chaotic model
3.2.1 Improved chaotic map
By introducing the Baker map and Logistic map in Sect. 3.1.1 and the model mentioned in Sect. 2, an improved chaotic system can be derived as following formulas:
where sequence {ai} can be calculated as follows:
Sequence {wi} can be calculated by Eq. (5) with the initial value μ0 and w0:
Moreover, because the parameter a ∈ (0, 1), we set v = 1. The process of selecting parameter k will be presented in the next section.
3.2.2 Selection of the parameter k
To select an appropriate parameter k, the Approximate entropy (ApEn) is used to measure the complexity of different chaotic sequences. Set the initial values v = 1, μ0 = 4.0, μ1 = 0.8, w0 = 0.123 and x = 0.561. The precision is set to be 2–12. For parameter k, we calculate the ApEn of the sequences with different parameters. The results are shown in Table 1 and Fig. 4. It can be found that the ApEn value will remain substantially stable since k = 1000. Therefore, In this paper, we always set k = 10,000.
3.3 Performance of improved chaotic system
In this section, we always set the initial parameters and values v = 1, μ0 = 4.0, μ1 = 0.8, w0 = 0.123, k = 10,000 and x = 0.561, the precision is set to be 2–12.
3.3.1 Trajectories, phase space and period analysis
The trajectory maps are shown in Fig. 5. From the trajectory point of view, the sequence {z0} produced by the improved chaotic system is random-like, while the x-dimensional time series of the Baker map enter a period after about 100 iterations. This can prove that our improvement on the original chaotic mapping is effective.
Figure 6 shows the phase space analysis of the original Baker sequence and the new chaotic sequence. The figure shows that the Baker sequence has a specific shape, whereas the improved sequence appears disorderly. It is thus shown that the parameters of the Baker map are changed at each iteration so that the control parameter ai changes with each iteration can improve the complexity of the system effectively. To calculate the length of the number sequence entering the period, we set different precision and uniformly set the length of the state sequence as 100,000, and the period analysis is shown in Table 2. We can conclude from Table 2 that the period of the sequence generated by the improved map has been greatly extended. When the precision is set to 2–19, the period of this new system cannot be detected. Comparing to other method, the period of the map can still be detected when the precision is set to be 2–36 in (Tang et al. 2019), which indicates that our method is more effective in reducing dynamical degradation.
3.3.2 Approximate entropy and permutation entropy analysis
In the application process, the approximate entropy shows the following features:
-
(1)
The approximate entropy only requires relatively short data to estimate a stable statistical value.
-
(2)
The approximate entropy has good anti-interference and anti-noise capabilities.
-
(3)
The approximate entropy can test both random and deterministic signals. The more complex and random the signal is, the higher the measured ApEn value is.
In addition, to find another way to measure the complexity of chaotic series, Bandt and Pompe has utilized the Permutation entropy (PE) (Bandt and Pompe 2002). This is another method to test sequence complexity, which has become a vital test index. The ApEn and PE values can be shown in Table 3 and Fig. 7. In Table 3 and Fig. 7a, b, we can see that both ApEn and PE values of the improved sequence are considerably larger than the Baker and Logistic sequences. Moreover, to compare with other methods, some comparison results are shown in Fig. 7c and d. From Fig. 7c and d, we can conclude that the ApEn values of our improved sequences are higher than the improved map mentioned in (Liu et al. 2018) and (Tang et al. 2019). Furthermore, our PE value is more closer to the ideal value 1 than the improved Logistic map proposed by (Tang et al. 2019). Such results prove that the generated chaotic sequences have a quite high complexity.
3.3.3 Bifurcation diagram analysis
A bifurcation diagram can show the region of control parameters of a chaotic system. In Eqs. (9) and (10), we have three control parameters in the improved chaotic system, μ0, μ1 and w0. Where μ0 and μ1 are two parameters related to the original map, thus we will compare these three chaotic systems in this section. Set the largest precision be 2–12, the bifurcation diagrams of parameters μ0 and μ1 are depicted in Fig. 8. From Fig. 8b and d, we can conclude that the improved system is chaotic since the parameter μ1 ∈ (0, 1) and μ0 ∈ [3.0, 4.0], and no periodic window could be found. While the Logistic map will be chaotic since μ0 > 3.57, and although the Baker map will be chaotic since 0 < μ1 < 1, the chaotic performance is not as good as that of the improved chaotic system.
3.3.4 Sensitivity analysis of initial values
Sensitivity to initial values and parameters is one of the significant properties of chaotic system. That is to say, even a slight change in the conditions of a chaotic system could result in a large difference in the iterative chaotic sequence. In this section, the sensitivity analysis of initial values x0 and parameters (μ0, μ1, w0) are shown in Fig. 9a–d, respectively. All subgraphs show that the trajectory has a great difference when the conditions are changed only by 2–12, which indicates that this improved chaotic system is sensitive to initial value and parameters.
3.3.5 Auto-correlation analysis
Correlation refers to the relationship between two variables and the related directions. This paper uses the auto-correlation function to evaluate the randomness of state sequences generated by the chaotic maps. If a sequence is an ideal random sequence, its auto-correlation function should be approximate to the delta function. In this test, we Set the largest precision be 2–14. The result of this auto-correlation analysis can be shown in Fig. 10. From the Fig. 10, we can have that the time series computed by the Baker map has strong correlations, while the correlations of sequence computed by improved chaotic map reach an ideal state quickly after a brief peak. Therefore, the auto-correlation property of this sequence is ideal.
3.3.6 Lyapunov exponent
Lyapunov exponents (LE) is used to described the divergence speed of trajectories of dynamical system. A dynamical system is called chaotic if its Lyapunov exponent is larger than zero. In this section, the Lyapunov exponents of the different parameters of the improved chaotic system are shown in Fig. 11. The figures display that the Lyapunov exponent is quite stable and always greater than zero when the parameters μ0 and μ1 in the range [3, 4.0] and (0, 1), respectively. Hence, our system is chaotic in this sense.
4 A Sine-2D LASM dual chaotic system
This section proposes another example of the novel chaotic system model. This chaotic system comprises Sine map and two-dimensional LASM.
4.1 Original chaotic map
4.1.1 Sine chaotic map
The Sine map is one of the most common low-dimensional chaotic map, which has many applications. The simple dynamic structure of the Sine map makes the calculation cost low and easy to simulate on the computer. The mathematical expressions are as follows:
where μ ∈ [0, 4], x ∈ (0, 1), xn is a state variable. Figure 12 shows the bifurcation diagram of this map. And we can conclude that when the range of μ from 3.5 to 4, the Sine map is chaotic.
4.1.2 2D Logistic-adjusted-Sine map
In (Hua and Zhou 2016), to improve the disadvantages of small parameter range and simple structure of a one-dimensional chaotic map, the author uses one-dimensional chaotic map to adjust another map and takes Sine map and Logistic map as an example. This example has better dynamical performance and a more comprehensive parameter range than many chaotic maps. Based on this 2D chaotic map, (Gan et al. 2018) designed an algorithm to encrypt the images. The simulation experiment results indicated that this algorithm's effect is more excellent than many encryption methods. The formula can be written as:
Here, u is the parameter ranging from 0 to1, xn and yn are state variables (xn, yn ∈ (0, 1)). Figure 13 shows the bifurcation diagram of this chaotic map, and we can find that the selection range of parameter u is from 0.31 to 0.92. Since the chaotic properties of these two sequences of this equation are similar, the x-dimensional and the improved chaotic sequence are used for performance comparison in this paper.
4.2 Improved chaotic system
4.2.1 Improved chaotic map
By introducing the 2D-LASM and Sine map in Sect. 4.1.1, the formula of this improved chaotic map can be derived as follows:
where sequence {ai} can be computed as follows:
And sequence {wi} can be calculated by Eq. (11) with the initial value μ0 and w0.
the range of parameter a of 2D LASM is a ∈ [0, 1], so we set a = 1. The process of selecting parameter k will be presented in the next section.
4.2.2 Selection of the parameter k
Similar to the selection method mentioned in Sect. 3.2.2, we still use the ApEn value as the selection criterion here. The approximate entropy values are different when using different parameters k in Eq. (14). We set the initial parameters and values v = 1, μ0 = 4.0, μ1 = 0.6, w0 = 0.123, x = 0.561, and y = 0.356. The precision is set to be 2–12. Moreover, the ApEn values of different k are shown in Table 4 and Fig. 14. From Table 4 and Fig. 14, we can conclude that the value of ApEn is stable since parameter k is larger than 100. Here we set k = 10,000 in this model.
4.3 Performance of improved chaotic system
Set the initial value and parameters be v = 1, μ0 = 4.0, μ1 = 0.6, w0 = 0.123, k = 10,000, x = 0.561 and y = 0.356; the precision is set to be 2–12.
4.3.1 Trajectories, phase space and period analysis of chaotic sequences
The trajectory diagram is shown in Fig. 15. It can be easily found that the sequence generated by 2D-LASM enters a cycle after a few times of iteration, while the time series of the improved map is random-like. Moreover, the phase analysis of the original chaotic maps and improved map are shown in Fig. 16. Compared with Fig. 16a of Eq. (12), the chaotic sequence of the improved chaotic system appears more uniformly; it does not have a fixed shape and distributed throughout the internal [0,1] evenly. Here we still set the sequence length we need to check to 100,000, and the period analysis of three chaotic maps is shown in Table 5. The period of this improved map has been greatly extended. When the computing precision is larger than 2–17, the period of this new system cannot be detected, which is bettern than the results of 2D-LASM.
4.3.2 Approximate entropy and permutation entropy analysis
The ApEn analysis and PE analyses are widely used in chaotic complexity tests. The higher the ApEn values of a chaotic map, the more complex its chaotic dynamics characteristics will be. Similar to the approximate entropy analysis, the permutation entropy analysis has the same properties. Slightly different from ApEn analysis, the PE value has an upper limitation, which is value 1. The closer the PE value is to 1, the higher complexity the sequence has. Set the largest precision be 2–12. Table 6 and Fig. 17a–d show the ApEn and PE values of the original chaotic maps and the improved chaotic model. It is easy to find that the ApEn and PE values of the improved chaotic system are always larger than the original 2D-LASM and the Logistic chaotic map, which means that the complexity has been greatly improved.
4.3.3 Bifurcation diagram analysis
For an ideal chaotic map, the chaotic region of control parameters should be as large as possible to obtain a larger key space. Here, we can show a region of control parameters of a chaotic system using a bifurcation diagram. Similar to the above example, we have three control parameters in this improved chaotic system, μ0, μ1, and w0, where μ0 and μ1 are two parameters related to the Sine map and 2D LASM, respectively. The bifurcation diagrams of parameters μ0 and μ1 (with a precision of 2–12) are depicted in Fig. 18. From Fig. 18 we can find that the improved chaotic map has a large chaotic region of control parameters than the Sine map and 2D-LASM, which indicates a larger key space.
4.3.4 Sensitivity analysis of initial values
Here, we test on the sensitivity of this improved chaotic system. Set the precision be 2−12, change the initial conditions slightly, and the sensitivity analysis of the parameters (μ0, μ1, w0) and initial values (x, y) are shown in Fig. 19. From Fig. 19, we can see the trajectory significantly differs when the initial conditions change only by 2–12. This indicates that this improved chaotic system is sensitive to initial values and parameters.
4.3.5 Auto-correlation analysis
Set the largest precision be 2–14. The auto-correlation analysis of the original chaotic map and improved chaotic system are presented in Fig. 20. From Fig. 20, we have that the improved chaotic system has an ideal auto-correlation property, while the sequence generated by original chaotic map has strong correlations.
4.3.6 Lyapunov exponent
The Lyapunov exponents of the improved chaotic system with different parameters are calculated and plotted in Fig. 21. From Fig. 21, we can have that the Lyapunov exponents of different control parameters of the improved chaotic system are always larger than zero when μ0 ∈ [0.1, 4.0] and μ1 ∈ (0, 1), which indicates that the improved chaotic system is chaotic within this parameter range.
5 Conclusion
When chaotic systems are simulated on computer, the degradation of dynamic properties is inevitable, especially for low-dimensional chaotic maps. To reduce dynamical degradation, in this paper, a new time-varied chaotic model is proposed. In this model, the output of one-dimensional chaotic map is used to caculate the parameters of another chaotic map. This method can make the parameters vary in real-time, thereby improving the dynamic performances and randomness of the chaotic system. In order to verify this model, two examples are presented. The dynamical behavior of sequences generated by these two examples are both better than the original sequences, which concludes that the proposed model is effective, and can be competitive withg other remedies. This method is universal, which can be used to any digitial chaotic maps. In the future work, we will apply this model to encrypt the images to verify its practicability.
Data availability
The datasets generated during and/or analyzed during the current study are available from the corresponding author on reasonable request.
References
Alawida M, Samsudin A, Teh JS, Alkhawaldeh RS (2019a) A new hybrid digital chaotic system with applications in image encryption. Signal Process 160:45–58
Alawida M, Samsudin A, Teh JS (2019b) Enhancing unimodal digital chaotic maps through hybridisation. Nonlinear Dyn 96(1):601–613
Bandt C, Pompe B (2002) Permutation entropy: A natural complexity measure for time series. Phys Rev Lett 88(17):174102
Baskonus HM, Mahmud AA, Muhamad KA, Tanriverdi T (2022) A study on Caudrey-Dodd-Gibbon-Sawada-Kotera partial differential equation. Math Methods Appl Sci 45(14):8737–8753
Cao LC, Luo YL, Qin SH et al (2015) A perturbation method to the tent map based on lyapunov exponent and its application. Chin Phys B 24(10):100501
Deng YS, Hu HP, Liu LF (2015a) Feedback control of digital chaotic systems with application to pseudorandom number generator. Int J Mod Phys C 26(2):1550022
Deng YS, Hu HP, Xiong NX et al (2015b) A general hybrid model for chaos robust synchronization and degradation reduction. Inf Sci 305:146–164
Deng YS, Hu HP, Xiong W et al (2015c) Analysis and design of digital chaotic systems with desirable performance via feedback control. IEEE Trans Syst Man Cybern Syst 45:1187–1200
Francois M, Defour D, berthome P (2014) A pseudo-random bit generator based on three chaotic logistic maps and IEEE 754-2008 floating-point arithmetic. Theory Appl Mod Comput 8402:229–247
Fan CL, Ding Q (2022) Counteracting the dynamic degradation of high-dimensional digital chaotic systems via a stochastic jump mechanism. Digital Signal Process 129:103651
Fan CL, Ding Q (2023) Design and geometric control of polynomial chaotic maps with any desired positive Lyapunov exponents. Chaos Solitons Fractals 169:113258
Gan ZH, Chai XL, Zhang MN et al (2018) A double color image encryption scheme based on three-dimensional brownian motion. Multimed Tools Appl 77(21):27919–27953
Hua ZY, Zhou YC (2016) Image encryption using 2D logistic-adjusted-sine map. Inf Sci 339:237–253
Hua ZY, Zhou BH, Zhou YC (2017) Sine-transform-based chaotic system with FPGA implementation. IEEE Trans Ind Electron 65(3):2736515
Hua ZY, Zhou YC, Huang HJ (2019) Cosine-transform-based chaotic system for image encryption. Inf Sci 480:403–419
Hua ZY, Zhu ZH, Yi S et al (2021) Cross-plain colour image encryption using a two dimensional logistic tent modular map. Inf Sci 546:1063–1083
Huang X, Liu LF, Li XJ et al (2019) A new two-dimensional mutual coupled logistic map and its application for pseudorandom number generator. Math Probl Eng 2019:7685359
Hu HP, Xu Y, Zhu ZQ (2008) A method of improving the properties of digital chaotic system. Chaos Solitons Fractals 38:439–446
Hu HP, Deng YS, Liu LF (2014) Counteracting the dynamical degradation of digital chaos via hybrid control. Commun Nonlinear Sci Numer Simul 19:1970–1984
Khedmati Y, Parvaz R, Behroo Y (2020) 2D Hybrid chaos map for image security transform based on framelet and cellular automata. Inf Sci 512:855–879
Kafetzis I, Moysis L, Tutueva A et al (2023) A 1D coupled hyperbolic tangent chaotic map with delay and its application to password generation. Multimed Tools Appl 82:9303–9322
Li RZ, Liu Q, Liu LF (2019) Novel image encryption algorithm based on improved logistic map. IET Image Proc 13(1):125–134
Liu LF, Miao SX (2015) A universal method for improving the dynamical degradation of a digital chaotic system. Phys Scr 90(8):085205
Liu LF, Miao SX (2017a) A new simple one-dimensional chaotic map and its application for image encryption. Multimed Tools Appl 77:21445–21462
Liu LF, Miao SX (2017b) Delay-introducing method to improve the dynamical degradation of a digital chaotic map. Inf Sci 396:1–13
Liu LF, Lin J, Miao SX et al (2017a) A double perturbation method for reducing dynamical degradation of the digital Baker map. Int J Bifurc Chaos 27:1750103
Liu YQ, Luo YL, Song SX (2017b) Counteracting dynamical degradation of digital chaotic Chebyshev map via perturbation. Int J Bifurc Chaos 27:1750033
Liu LF, Liu BC, Hu HP et al (2018) Reducing the dynamical degradation by bi-coupling digital chaotic maps. Int J Bifurc Chaos 28(5):1850059
Lynnyk V, Sakamoto N, Čelikovský S (2015) Pseudo random number generator based on the generalized Lorenz chaotic system. IFAC Pap Online 48(18):257–261
Luo YL, Liu YQ, Liu JX et al (2021) Counteracting dynamical degradation of a class of digital chaotic systems via unscented Kalman filter and perturbation. Inf Sci 556:49–66
Ming H, Hu HP, Lv F et al (2023) A high-performance hybrid random number generator based on a nondegenerate coupled chaos and its practical implementation. Nonlinear Dyn 111:847–869
Nagaraj N, Shastry M, Vaidya PG (2008) Increasing average period lengths by switching of robust chaos maps in finite precision. Eur Phys J Spec Top 165(1):73–83
Sun FY, Liu ST (2009) Cryptographic pseudo-random sequence from the spatial chaotic map. Chaos Solitons Fractals 41:2216–2219
Tang JY, Yu ZN, Liu LF (2019) A delay coupling method to reduce the dynamical degradation of digital chaotic maps and its application for image encryption. Multimed Tools Appl 78:24765–24788
Tanriverdi T, Baskonus HM, Mahmud AA, Muhamad KA (2021) Explicit solution of fractional order atmosphere-soil-land plant carbon cycle system. Ecol Complex 48:100966
Teh JS, Samsudin A, Akhavan A (2015) Parallel chaotic hash function based on the shuffle-exchange network. Nonlinear Dyn 81(3):1067–1079
Teh JS, Samsudin A (2017) A chaos-based authenticated cipher with associated data. Secur Commun Netw 2017:1–15
Wang XY, Guo K (2014) A new image alternate encryption algorithm based on chaotic map. Nonlinear Dyn 76(4):1943–1950
Wheeler DD, Matthews RAJ (1991) Supercomputer investigations of a chaotic encryption algorithm. Cryptologia 15:140–151
Wang QX, Yu SM, Li CQ et al (2016) Theoretical design and FPGA-based implementation of higher-dimensional digital chaotic systems. IEEE Trans Circuits Syst I 63:401–412
Wu Y, Zhou Y, Bao L (2014) Discrete wheel-switching chaotic system and applications. IEEE Trans Circuits Syst I 61(12):3469–3477
Xiao D, Liao X, Deng S (2005) One-way Hash function construction based on the chaotic map with changeable-parameter. Chaos Solitons Fractals 24:65–71
Zheng F, Tian XJ, Song JY et al (2008) Pseudo-random sequence generator based on the generalized Henon map. J China Univ Posts Telecommun 15(3):64–68
Zhou YC, Bao L, Chen CLP (2013) Image encryption using a new parametric switching chaotic system. Signal Process 93(2013):3039–3052
Zhou YC, Bao L, Chen CLP (2014) A new 1D chaotic system for image encryption. Signal Process 97:172–182
Zhou YC, Hua Z, Pun C, Chen CLP (2015) Cascade chaotic systems with applications. IEEE Trans Cybern 45(9):2001–2012
Zhou S, Wang XY, Zhang YQ (2023) Novel image encryption scheme based on chaotic signals with finite-precision error. Inf Sci 621:782–798
Zheng J, Hu HP (2022) Bit cyclic shift method to reinforce digital chaotic maps and its application in pseudorandom number generator. Appl Math Comput 420:126788
Funding
This work is supported by the National Natural Science Foundation of China (62262039, 61862042); Outstanding Youth Foundation of Jiangxi Province (20212ACB212006).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Zhang, S., Liu, L. Generation of ideal chaotic sequences by reducing the dynamical degradation of digital chaotic maps. Soft Comput 28, 4471–4487 (2024). https://doi.org/10.1007/s00500-023-08836-z
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-023-08836-z