Abstract
Generating pseudorandom numbers with good statistical performance based on chaotic maps has become a topic of interest in chaotic cryptography. Several high-order polynomial chaotic maps with special forms are proposed by the Li–Yorke theorem in this paper, and chaotic conditions and intervals are given. The dynamical behaviors of chaotic maps satisfying the chaotic conditions are numerically analyzed, such as the bifurcation and Lyapunov exponent, the analysis results show the correctness of the related chaos criterion theorems. Chaotic maps are essential for the design of pseudorandom number generator and are widely used in many applications. Based on the superposition of chaotic maps, a pseudorandom number generator is designed, and the available chaotic parameters of the pseudorandom number generator are increased through the superposition of chaotic maps. This paper tests and analyses the performance of pseudorandom sequences produced by the pseudorandom number generator, and the analysis results show that pseudorandom sequences produced by pseudorandom number generator have good randomness, uniformity, complexity, and sensitivity to the initial parameters. Performance analyses show that the pseudorandom number generator in this paper can generate sequences with high quality. Several high-order polynomial chaotic maps we constructed based on the Li–Yorke theorem enrich the chaotic map and provide the possibility for its application in the field of cryptography.
Similar content being viewed by others
Availability of data and material
The data that support the findings of this study are available from the corresponding author upon reasonable request.
References
Naskar, P.K., Bhattacharyya, S., Nandy, D., Chaudhuri, A.: A robust image encryption scheme using chaotic tent map and cellular automata. Nonlinear Dyn. 100(3), 2877–2898 (2020)
Lambic, D.: A new-space chaotic map based on the multiplication of integer numbers and its application in S-box design. Nonlinear Dyn. 100(1), 699–711 (2020)
Ben Farah, M.A., Farah, A., Farah, T.: An image encryption scheme based on a new hybrid chaotic map and optimized substitution box. Nonlinear Dyn. 99(4), 3041–3064 (2020)
Li, T.Y., Yorke, J.A.: Period three impiles chaos. Am. Math. Mon. 82(10), 985–992 (1975)
Min, L.Q., Hu, K.X., Zhang, L.J.: Study on pseudorandomness of some pseudorandom number generators with application. In: International conference on computational intelligence and security (CIS) IEEE, pp. 569–574 (2013)
Hu, C., Li, Z.J., Chen, X.X.: Dynamics analysis and circuit implementation of fractionalorder Chua’s system with negative parameters. Acta Phys. Sin. 66(23), 60–69 (2017)
Hao, J., Li, H.J., Yan, H.Z., Mou, J.: A new fractional chaotic system and its application in image encryption with DNA mutation. IEEE Access. 9, 52364–52377 (2021)
Zhang, X., Shi, Y.M., Chen, G.R.: Constructing chaotic polynomial maps. Int. J. Bifurc. Chaos. 19(2), 531–543 (2009)
Zhang, X.: Chaotic polynomial maps. Int. J. Bifurc. Chaos. 26(8), 1650131 (2016)
Zhou, H.L., Song, E.B.: Discrimination of the 3-periodic points of a quadratic polynomial. J. Sichuan Univ. 46(3), 561–564 (2009)
Chu, J.X., Min, L.Q.: Chaos criterion theorems on specific 2n order and 2n + 1 order polynomial maps with application. Sciencepaper Online. http://www.paper.edu.cn/relea-sepaper/content/202001-28. Accessed 20 July 2021
Yang, X.P., Min, L.Q., Wang, X.: A cubic map chaos criterion theorem with applications in generalized synchronization based pseudorandom number generator and image encryption. Chaos 25(5), 053104 (2015)
Wei, X.Y., Zang, H.Y.: Construction and complexity analysis of new cubic chaotic maps based on spectral entropy algorithm. J. Intell. Fuzzy Syst. 37(4), 4547–4555 (2019)
Murillo-Escobar, M.A., Cruz-Hernandez, C., Cardoza-Avendano, L., Mendez-Ramirez, R.: A novel pseudorandom number generator based on pseudorandomly enhanced logistic map. Nonlinear Dyn. 87(1), 407–425 (2017)
Wang, Y., Liu, Z.L., Ma, J.B.: A pseudorandom number generator based on piecewise logistic map. Nonlinear Dyn. 83(4), 2373–2391 (2016)
Liu, L.F., Miao, S.X., Hu, H.P.: N-phase logistic chaotic sequence and its application for image encryption. IET Signal Process. 10(9), 1096–1104 (2017)
Dastgheib, M.A., Farhang, M.: A digital pseudo-random number generator based on sawtooth chaotic map with a guaranteed enhanced period. Nonlinear Dyn. 89(4), 2957–2966 (2017)
Xu, Z.G., Tian, Q., Tian, L.: Theorem to generate independently and uniformly distributed chaotic key stream via topologically conjugated maps of tent map. Math. Probl. Eng. 2012, 619257 (2012)
He, S.B., Sun, K.H., Wang, H.H.: Modifified multiscale permutation entropy algorithm and its application for multiscroll chaotic systems. Complexity 21(5), 52–58 (2016)
Dang, T.S., Palit, S.K., Mukherjee, S., Hoang, T.M., Banerjee, S.: Complexity and synchronization in stochastic chaotic systems. Eur. Phys. J.-Spec. Top. 225(1), 159–170 (2016)
Zhang, Z.Q., Wang, Y., Zhang, L.Y., Zhu, H.: A novel chaotic map constructed by geometric operations and its application. Nonlinear Dyn. 102(4), 2843–2858 (2020)
Sun, K.H., He, S.B., He, Y., Yin, L.Z.: Complexity analysis of chaotic pseudo-random sequences based on spectral entropy algorithm. Acta Phys. Sin. 62(1), 010501 (2013)
Min, L.Q., Zhang, L.J., Zhang, Y.Q.: A novel chaotic system and design of pseudorandom number generator. In: International conference on intelligent control and information processing (ICICIP) IEEE, pp. 545–550 (2013)
Bassham, L., Rukhin, A., Soto, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Hecke-rt, N., Dray, J.: A statistical test suite for random and pseudo-random number generator for cryptographic applications. Natl. Inst. Stand. Technol. https://nvlpubs.nist.gov/nistpubs/Legacy/SP/nistspecialpublication800-22r1a.pdf. Accessed 20 July 2021
Zhao, Y., Gao, C.Y., Liu, J., Dong, S.Z.: A self-perturbed pseudo-random sequence generator based on hyperchaos. Chaos Solitons Fract. 4, 100023 (2019)
Wang, L.Y., Cheng, H.: Pseudo-random number generator based on logistic chaotic system. Entropy 21(10), 960 (2019)
Funding
This paper is not supported by any funding.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflicts of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Electronic supplementary material
Below is the link to the electronic supplementary material.
Appendix
Appendix
1.1 Examples of several polynomial chaotic maps with other forms
Example 1. For Theorem 3 in Table 1, let \(n = 2\), \(H(x) = x(qx^{4} + b)\).
The image of the maps \(g_{3} \left( \mu \right)\) and \(g_{4} (b)\) are given in Fig.
7.
The solution of \(g_{3} \left( \mu \right) = 0\) in \(({1 \mathord{\left/ {\vphantom {1 5}} \right. \kern-\nulldelimiterspace} 5},1)\) is
The solution of \(g_{4} \left( b \right) = 0\) in \(({5 \mathord{\left/ {\vphantom {5 4}} \right. \kern-\nulldelimiterspace} 4},5)\) is
Therefore, if
then \(H(x)\) is chaotic.
Example 2. For Theorem 4 in Table 1, let \(n = 3\), \(G(x) = x(ax^{5} + b)\).
The image of the map \(g_{5} \left( \mu \right)\) is shown in Fig.
8.
The solution of \(g_{5} \left( \mu \right) = 0\) in \(({1 \mathord{\left/ {\vphantom {1 6}} \right. \kern-\nulldelimiterspace} 6},1)\) is
Therefore, if
then \(G(x)\) is chaotic.
Example 3. For Theorem 5 in Table 1, let \(n = 2\), \(f(x) = x(x^{2} - 4)(x^{2} - 9)\), \(b > 0\), we can obtain
From \(f(x)\), we can obtain maximum \(f\left( {\frac{{\sqrt {390 - 30\sqrt {89} } }}{10}} \right) \approx 24.03436770\) in \((0,2)\), the maximum is the largest maximum on \((0,3)\).
From \(Q(x)\), we can obtain
Then \(Q(x)\) is chaotic in \([ - 3,3]\).
Example 4. For Theorem 6 in Table 1, let \(n = 2\), \(R(x) = (ax^{2} + bx)(x + \frac{b}{2a})^{4}\).
Then \(t_{2} = \frac{{ - (n + 1) - \sqrt {n(n + 1)} }}{2(n + 1)} = \frac{ - 3 - \sqrt 6 }{6}\),
Therefore, when
or
then \(R(x)\) is chaotic.
1.2 The numerical simulation of dynamical behaviors
For example 1, \(H(x) = x(qx^{4} + b)\), we can obtain
Let \(q = - 1\), \(x_{0} = 0.1\), the bifurcation graph and Lyapunov exponent spectrum are given in Fig.
9. As can be seen from Fig. 9, this system is in a state of chaos when \(b \in \left[ {1.74458380,2.063286489} \right]\). The Lyapunov exponent is close to 1 and reaches the maximum when \(b\) is about \(2.0632\) in Fig. 9, which means that the system has the best chaotic behavior.
For example 2, \(G(x) = x(ax^{5} + b)\), we can obtain
Let \(a = - 1\), \(x_{0} = 0.1\), the bifurcation graph and Lyapunov exponent spectrum are shown in Fig.
10. As can be seen from Fig. 10, this system is in a state of chaos when \(b \in \left[ {1.59970751,1.71716290} \right]\). The Lyapunov exponent is greater than 0.6 and reaches the maximum when \(b\) is about \(1.7171\) in Fig. 10, which means that the system has the best chaotic behavior.
For example 3, \(f(x) = x(x^{2} - 4)(x^{2} - 9)\), \(Q(x) = bx(x^{2} - 4)(x^{2} - 9)\), \(b > 0\), we can obtain \(0.08321417 \le b \le 0.12482126\), let \(x_{0} = 0.1\), the bifurcation graph and Lyapunov exponent spectrum are given in Fig.
11. As can be seen from Fig. 11, this system is in a state of chaos when \(b \in \left[ {0.08321417,0.12482126} \right]\). The Lyapunov exponent is greater than 1 and reaches the maximum when \(b\) is about \(0.132\) in Fig. 11, which means that the system has the best chaotic behavior.
For example 4, \(R(x) = (ax^{2} + bx)\left( {x + \frac{b}{2a}} \right)^{4}\), let \(b = 1\), we can obtain
Let \(x_{0} = 0.1\), the bifurcation graph and Lyapunov exponent spectrum are shown in Fig.
12. As can be seen from Fig. 12, this system is in a state of chaos when \(b \in \left[ { - 0.26084729, - 0.21934580} \right]\). The Lyapunov exponent is greater than 1 and reaches the maximum when \(b\) is about \(- 0.2194\) in Fig. 12, which means that the system has the best chaotic behavior.
Let \(a = \pm 1\), we can obtain \(2.93015727 \le b \le 3.36586392\), let \(x_{0} = 0.1\), the bifurcation graph and Lyapunov exponent spectrum are given in Fig.
13. As can be seen from Fig. 13, this system is in a state of chaos when \(b \in \left[ {2.93015727,3.36586392} \right]\). The Lyapunov exponent is greater than 1 and reaches the maximum when \(b\) is about \(3.3658\) in Fig. 13, which means that the system has the best chaotic behavior. The changing trend of the Lyapunov exponent of example 4 is similar while parameters \(a\) and \(b\) vary.
From example 1 to example 4, the Lyapunov exponents of these systems are between 0 and 1.5. Their Lyapunov exponents are about the same when example 3 and example 4 are at their best chaotic behavior, respectively. It can be concluded from the above analysis, the best chaotic behaviors of example 3 and example 4 are better than the best chaotic behavior of example 1, the best chaotic behavior of example 1 is better than the best chaotic behavior of example 2.
Rights and permissions
About this article
Cite this article
Zang, H., Zhao, X. & Wei, X. Construction and application of new high-order polynomial chaotic maps. Nonlinear Dyn 107, 1247–1261 (2022). https://doi.org/10.1007/s11071-021-06982-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11071-021-06982-3