Skip to Content
MathematicsMathematics
  • Article
  • Open Access

26 February 2026

18 Pages

Construction of a New Discrete Chaotic Mapping Based on the Robust Chaos Theorem

,
,
,
and
1
Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation, School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541002, China
2
Center for Applied Mathematics of Guangxi (GUET), Guilin 541002, China
3
Academy of Excellent Engineers, Guangxi Artificial Intelligence College, Nanning 530201, China
*
Authors to whom correspondence should be addressed.

Abstract

Chaotic systems serve as fundamental pseudo-random sequence generators in encryption algorithms and play a vital role in communication security. However, most current research still focus on the classical Logistic chaotic map, making it vulnerable to targeted attacks. To address this issue, this paper proposes a general construction method for a class of cubic chaotic maps over the real number field and proves the existence of chaos based on the robust chaos criterion for S-unimodal maps. Furthermore, by integrating the proposed cubic chaotic map with the infinite folding map, a new one-dimensional discrete chaotic map is developed. Dynamical analysis demonstrates that, compared with the infinite folding map and the Logistic map, the newly constructed map exhibits stronger chaotic behavior and more stable complexity, showing superior potential for practical applications in secure communications.

1. Introduction

Discrete chaotic mappings constitute a class of mathematical models that have been extensively studied in dynamical systems and chaos theory, and they are capable of effectively characterizing the nonlinear dynamical behavior of a wide range of natural and social systems. Among them, the Logistic map has been widely adopted in various chaotic cryptosystems due to its high computational efficiency and simple, easily controllable parameter structure. In 1976, the famous biologist May proposed the Logistic mathematical model [1]. The proposal of logistic mappings can be said to be the beginning of the study of discrete chaotic systems, which is important for the development of discrete chaotic systems. After that, many discrete chaotic systems were proposed, such as the familiar Tent mapping [2] and Cubic mapping [3]. The study of discrete chaotic mappings is not only important for theoretical science, but also has a wide range of applications. For example, it has important applications in communication encryption [4], image encryption [5,6,7,8,9], chaotic cryptanalysis [10,11], and communication security [12,13]. Therefore, the in-depth study of discrete chaotic mappings has important theoretical and practical significance.
Kocarev et al. [14] pointed out that, in the design of chaotic ciphers, the selected chaotic map should at least possess three essential properties: strong mixing property, robustness, and a large parameter space. The mixing property requires that any slight variation in the plaintext be sufficiently diffused to affect as many ciphertext components as possible. Robustness refers to the ability of a chaotic system to preserve its chaotic behavior under small parameter perturbations, thereby ensuring its inherent space-diffusion characteristics. Therefore, when constructing a chaos-based cryptographic algorithm, it is highly desirable to select chaotic systems that exhibit both strong mixing and robustness over a wide range of parameter values. Song et al. [15] proposed a composite chaotic system (S-L-F) with cascaded sinusoidal mapping, generalized third-order Fibonacci, and logistic chaos. Alawida et al. [16] enhanced the dynamical structure of the classical logistic map, significantly enlarging its chaotic parameter range and improving randomness and robustness for cryptographic applications. Subsequently, Hosny et al. [17] proposed a multi-image encryption framework integrating multiple chaotic maps, which effectively strengthens diffusion, key sensitivity, and resistance to cryptanalytic attacks. In addition, Fedoseev et al. [18] introduced a discrete chaotic map with adaptive symmetry for encryption design, further improving dynamical complexity and overall security performance. These studies indicate that chaotic maps exhibiting strong mixing and robustness over wide parameter ranges remain crucial for the design of secure chaos-based cryptographic algorithms.
In recent years, with the advancement of chaotic control and reinforcement learning technologies, robustness analysis of chaotic systems has attracted considerable research interest. Several studies have focused on modeling and dynamical analysis of chaotic systems, including detailed investigations of high-dimensional and hyperchaotic dynamics and adaptive synchronization behaviors [19,20,21,22]. Concurrently, efforts have been made in the control and optimization of chaotic systems, where novel control strategies such as reinforcement learning-based control and adaptive active set methods are introduced to enhance stability and robustness under perturbations [23,24,25,26]. These approaches, including complex nonlinear feedback and adaptive reliability optimization, systematically improve the stability, performance, and robustness of chaotic behavior under varying parameter and information conditions. For example, based on previous results, Xu et al. [27] proposed a general method for a class of quadratic chaotic mappings and justified its existence based on a robust chaos determination theorem for S single-peaked mappings. In addition, several studies have leveraged the intrinsic properties of chaotic systems to develop optimization algorithms, such as particle swarm optimization and ant colony optimization [28]. Consequently, enhancing the intrinsic characteristics of chaotic systems—particularly improving their robustness from a theoretical perspective—remains of critical importance. Chaotic robustness is a complex and fundamental issue, with broad applications in chaotic control, system optimization, and secure information processing. This paper proposes a general method for constructing cubic chaotic mappings based on the robust chaos theorem, which further improves the robustness of chaotic systems and provides better methods and ideas for solving practical problems. Finally, based on the proposed construction method, a cubic chaotic map was generated and then combined with the infinite folding map to yield a novel discrete chaotic map. Dynamical analysis confirms that this new map exhibits stronger chaotic properties than both the infinite folding map and the Logistic map.
The rest of the paper is organized as follows: in Section 2, the parameter settings of a general class of cubic chaotic mappings are given based on the S-peak mapping theorem, and the results are verified by data simulation experiments. In Section 3, a more complex discrete chaotic mapping is constructed based on the robust chaos theorem given in Section 2, combined with an infinite folding mapping, and its dynamics is analyzed.

2. Robust Chaos for General Cubic Mapping

Based on Li-York’s “period three implies chaos” theorem, Andrecut and Ali proposed a judgment theorem [29] for robust chaos of S single-peaked mappings.
Definition 1.
Mapping  φ x :  J = p , q → J  is called  S  single-peaked mapping if the following conditions are satisfied.
(1)
The mapping  φ x  has a continuous third-order derivative function;
(2)
p  is an immovable point, and there exists an original image  q , i.e.,  φ p = φ q = p ;
(3)
The existence of a unique maximal point  m  on the interval  p , q  for the mapping  φ x  such that the mapping  φ x  strictly increases on the interval  p , m  and strictly decreases on the interval  m , q ;
(4)
Mapping  φ x  has a negative Schwarzian derivatives, i.e.,
S φ , x = φ ‴ x φ ′ x − 3 ( φ ″ x ) 2 2 ( φ ′ x ) 2 < 0 .
The chaos theorem based on the S single-peaked mapping is as follows.
Theorem 1.
If the mapping  φ v x :  J = p , q → J  is a  S  single-peaked mapping containing the parameters  v  and there exists a maximum at the point  m ∈ p , q  such that for any parameter   v ∈ v m i n , v m a x ,  φ v m = q , then the mapping  φ v x  for any parameter  v ∈ v m i n , v m a x  is chaotic.
Here, the cubic formula and its proof are given below.
Theorem 2.
Given a general cubic equation with real coefficients  a x 3 + b x 2 + c x + d = 0 , let  D = b 2 − 3 a c  ( λ ∈ R ); if  D > 0 ,  λ < 1 , set  λ = cos θ   ( 0 < θ < π ) , then the equation has three unequal real roots
x 1 = − b + D ⋅ 2 cos ( θ 3 ) 3 a , x 2 = − b + D ⋅ 2 cos ( θ 3 + 2 3 π ) 3 a , x 3 = − b + D ⋅ 2 cos ( θ 3 − 2 3 π ) 3 a .
where  θ = cos − 1 λ .
Corollary 1.
The general cubic equation with real coefficients  a x 3 + b x 2 + c x + d = 0  has three unequal real roots, then
(a)
If  a > 0 , then  x 2 < x 3 < x 1 ;
(b)
If  a < 0 , then  x 1 < x 3 < x 2 .
The judgment theorem for robust chaos of general cubic polynomial mapping is constructed below.
Let the cubic function be
φ x = a x 3 + b x 2 + c x + d ,    a ≠ 0
where let D = b 2 − 3 a c , λ = 9 a b c − 2 b 3 − 27 a 2 d 2 ( D ) 3 . Let the parameters v ∈ − ∞ , 0 ∪ ( 4 , + ∞ ) , such that b 2 = v a c ; to construct the chaotic mapping, it is first obvious that there exists a continuous third-order derivative of φ x :
φ ′ x = 3 a x 2 + 2 b x + c ,
φ ″ x = 6 a x + 2 b ,
φ ‴ x = 6 a .
Let φ ′ x = 0 , we can solve for m = − b − D 3 a and m ∗ = − b + D 3 a , where m and m ∗ are the extreme value points of φ x . Substituting m and m ∗ into Equation (5), we obtain
φ ″ m = 6 a − b − D 3 a + 2 b = − 2 b − 2 D + 2 b = − 2 D < 0
φ ″ m ∗ = 6 a − b + D 3 a + 2 b = − 2 b + 2 D + 2 b = 2 D > 0
So m is the local maximum point of φ x , and m ∗ is the local minimum point of φ x .
For ∀ a , b , c , d ∈ R , all have
S ( φ , x ) = φ ‴ ( x ) φ ′ ( x ) − 3 ( φ ″ ( x ) ) 2 2 ( φ ′ ( x ) ) 2 = 6 a 3 a x 2 + 2 b x + c − 3 ( 6 a x + 2 b ) 2 2 ( 3 a x 2 + 2 b x + c ) 2 = 12 a ( 3 a x 2 + 2 b x + c ) − 3 ( 6 a x + 2 b ) 2 2 ( 3 a x 2 + 2 b x + c ) 2 = − 6 6 a 2 x 2 + 4 a b x − a c + b 2 2 ( 3 a x 2 + 2 b x + c ) 2 = − 6 6 ( a x + b 3 ) 2 + ( b 2 − 3 a c ) 3 2 ( 3 a x 2 + 2 b x + c ) 2 < 0 .
Therefore, φ x has a negative Schwarzian derivative.
To consider all cases of the coefficient sign, a discussion of the case is needed.
1. When a > 0 ,
(1)
If b > 0 , assume that in φ x there exists three unequal real roots, and by Theorem 2, there must be D > 0 , λ < 1 , and ∀ v ∈ − ∞ , 0 ∪ 4 , + ∞ . There must be b 2 − 4 a c > D = b 2 − 3 a c > 0 and therefore D > 0 .
Let λ < 1 , that is, − 1 < 9 a b c − 2 b 3 − 27 a 2 d 2 ( D ) 3 < 1 . Because 2 ( D ) 3 > 0 , − 2 ( D ) 3 < 9 a b c − 2 b 3 − 27 a 2 d < 2 ( D ) 3 ,   9 a b c − 2 b 3 − 2 ( D ) 3 < 27 a 2 d .
Set 27 a 2 d = u ( 9 a b c − 2 b 3 + 2 ( D ) 3 ) , and have 9 a b c − 2 b 3 − 2 ( D ) 3 9 a b c − 2 b 3 + 2 ( D ) 3 < u < 1 . Because v = b 2 a c , D = b 2 − 3 a c ; there are 9 v   − 2 − 2 ( 1 − 3 v ) 3 9 v   − 2 + 2 ( 1 − 3 v ) 3 < u < 1 , that is,
1 − 4 ( 1 − 3 v ) 3 2 9 v − 2 + 2 ( 1 − 3 v ) 3 2 < u < 1
and by assumption that 27 a 2 d = u ( 9 a b c − 2 b 3 + 2 ( D ) 3 ) , there are
λ = 9 a b c − 2 b 3 − 27 a 2 d 2 ( D ) 3 = 9 a b c − 2 b 3 − u ( 9 a b c − 2 b 3 + 2 ( D ) 3 ) 2 ( D ) 3 = 9 − 2 v − 9 u + 2 u v 2 v ( 1 − 3 v ) 3 2 − u .
From λ = cos θ   ( 0 < θ < π ) , we have
θ = cos − 1 λ = cos − 1 ( 9 − 2 v − 9 u + 2 u v 2 v ( 1 − 3 v ) 3 2 − u )
From Theorem 2, we can solve for φ x = 0 with three unequal real roots:
x 1 = − b + D ⋅ 2 cos ( θ 3 ) 3 a , x 2 = − b + D ⋅ 2 cos ( θ 3 + 2 3 π ) 3 a , x 3 = − b + D ⋅ 2 cos ( θ 3 − 2 3 π ) 3 a .
By Corollary 1, when a > 0 , the roots of φ x = 0 are x 1 > x 3 > x 2 , and because m < m ∗ , let p = x 2 ,   q = x 3 ,   r = x 1 , so the function φ x is increasing on p , m and decreasing on m , q and φ p = φ q = 0 .
Let there be another cubic function:
φ ∗ x = a x 3 + b x 2 + c x + d ∗ .      a ≠ 0
where d ∗ = d + p = u 9 a b c − 2 b 3 + 2 ( D ) 3 − 9 a b + 2 D cos ( θ 3 + 2 3 π ) 27 a 2 , then there must be φ p = φ q = p . Then, at this time, the function φ ∗ x is S single-peaked mapping.
To make φ ∗ x a chaotic mapping,
φ ∗ u , v ( m ) = a ( − b − D 3 a ) 3 + b ( − b − D 3 a ) 2 + c ( − b − D 3 a ) + d ∗ = − b 3 − 3 b 2 D − 3 b D − ( D ) 3 27 a 2 + b 3 + 2 b 2 D + D 9 a 2 + − b c − c D 3 a + d ∗ .
Substituting D = b 2 − 3 a c , let φ ∗ u , v m = q ; then we have
φ ∗ u , v ( m ) = 2 b 3 + 3 b 2 b 2 − 3 a c − 9 a b c − ( b 2 − 3 a c ) 3 − 9 a c b 2 − 3 a c + 27 a 2 d ∗ 27 a 2 = ( 2 − 2 u ) b 3 + ( 3 b 2 − 9 a c ) b 2 − 3 a c − ( 9 u − 9 ) a b c − ( b 2 − 3 a c ) 3 + 2 u ( b 2 − 3 a c ) 3 27 a 2 − 9 a b − 18 a b 2 − 3 a c cos ( θ 3 + 2 3 π ) 27 a 2 = − 9 a b + 18 a b 2 − 3 a c cos ( θ 3 − 2 3 π ) 27 a 2 ,
2 − 2 u b 3 + 3 b 2 − 9 a c b 2 − 3 a c − 9 u − 9 a b c − ( b 2 − 3 a c ) 3 + 2 u ( b 2 − 3 a c ) 3 27 a 2 = 18 a b 2 − 3 a c cos ( θ 3 − 2 3 π ) − 18 a b 2 − 3 a c cos ( θ 3 + 2 3 π ) 27 a 2
Then, from b 2 = v a c , we obtain
2 − 2 u b 3 + b 3 3 − 9 v b 2 − 3 a c − 9 u − 9 v b 3 − b 3 ( 1 − 3 v ) 3 2 + 2 u b 3 ( 1 − 3 v ) 3 2 = 18 a b 1 − 3 v cos ( θ 3 − 2 3 π ) − cos ( θ 3 + 2 3 π )
Since b > 0 , it follows that
b = 18 a 1 − 3 v cos ( θ 3 − 2 3 π ) − cos ( θ 3 + 2 3 π ) 2 − 2 u + 3 − 9 v 1 − 3 v + 9 u − 9 v + 2 u − 1 ( 1 − 3 v ) 3 2 ,
d ∗ = 9 a b u c − 1 + 18 a b 2 − 3 a c cos ( θ 3 + 2 3 π ) + 2 u ( b 2 − 3 a c ) 3 2 − 2 u b 3 27 a 2 .
Then, if φ ∗ m parameters satisfy Equations (10), (12), (19) and (20), then φ ∗ m on the interval p , q is chaotic.
To discuss other cases in the same way.
(2)
If b < 0 , assume that in φ x there exist three unequal real roots, and by Theorem 2, there must be D > 0 and λ < 1 , and that ∀ v ∈ − ∞ , 0 ∪ 4 , + ∞ . There must be b 2 − 4 a c > D = b 2 − 3 a c > 0 . Thus, D > 0
By b < 0 , λ < 1 , it is observed that 9 a b c − 2 b 3 − 2 ( D ) 3 9 a b c − 2 b 3 + 2 ( D ) 3 < u < 1 , and because v = b 2 a c , D = b 2 − 3 a c , there are 9 v   − 2 + 2 ( 1 − 3 v ) 3 9 v   − 2 − 2 ( 1 − 3 v ) 3 < u < 1 , that is,
1 + 4 ( 1 − 3 v ) 3 2 9 v − 2 − 2 ( 1 − 3 v ) 3 2 < u < 1 .
Similarly, we can obtain
θ = cos − 1 ( 9 a b c − 2 b 3 − u ( 9 a b c − 2 b 3 + 2 ( D ) 3 ) 2 ( D ) 3 ) = cos − 1 ( 9 − 2 v − 9 u + 2 u v − 2 v ( 1 − 3 v ) 3 2 − u )
From (1), we still have p = − b + D ⋅ 2 cos ( θ 3 + 2 3 π ) 3 a ,    q = − b + D ⋅ 2 cos ( θ 3 − 2 3 π ) 3 a . The function increases on p , m and decreases on m , q and φ p = φ q = 0 .
Therefore, from Equation (14), we have φ p = φ q = p . Then, the function φ ∗ x is S single-peaked mapping at this time.
In order to make φ ∗ x a chaotic mapping, substitute D = b 2 − 3 a c into Equation (15), and let φ ∗ u , v m = q to obtain
φ ∗ u , v ( m ) = 2 b 3 + 3 b 2 b 2 − 3 a c − 9 a b c − ( b 2 − 3 a c ) 3 − 9 a c b 2 − 3 a c + 27 a 2 d ∗ 27 a 2 = ( 2 − 2 u ) b 3 + ( 3 b 2 − 9 a c ) b 2 − 3 a c − ( 9 u − 9 ) a b c − ( b 2 − 3 a c ) 3 + 2 u ( b 2 − 3 a c ) 3 27 a 2 − 9 a b − 18 a b 2 − 3 a c cos ( θ 3 + 2 3 π ) 27 a 2 = − 9 a b + 18 a b 2 − 3 a c cos ( θ 3 − 2 3 π ) 27 a 2 ,
( 2 − 2 u ) b 3 27 a 2 + ( 3 b 2 − 9 a c ) b 2 − 3 a c 27 a 2 − ( 9 u − 9 ) a b c 27 a 2 − ( b 2 − 3 a c ) 3 27 a 2 + 2 u ( b 2 − 3 a c ) 3 27 a 2 = 18 a b 2 − 3 a c cos ( θ 3 − 2 3 π ) 27 a 2 − 18 a b 2 − 3 a c cos ( θ 3 + 2 3 π ) 27 a 2 .
Then, by b 2 = v a c , it follows that
2 − 2 u b 3 + b 3 3 − 9 v b 2 − 3 a c − 9 u − 9 v b 3 − b 3 ( 1 − 3 v ) 3 2 + 2 u b 3 ( 1 − 3 v ) 3 2 = 18 a b 1 − 3 v cos ( θ 3 − 2 3 π ) − cos ( θ 3 + 2 3 π ) .
Since b < 0 , it follows that
b = − 18 a 1 − 3 v cos ( θ 3 + 2 3 π ) − cos ( θ 3 − 2 3 π ) 2 − 2 u − 3 − 9 v 1 − 3 v + 9 u − 9 v + 2 u − 1 ( 1 − 3 v ) 3 2 ,
d ∗ = 9 a b u c − 1 + 18 a b 2 − 3 a c cos ( θ 3 + 2 3 π ) + 2 u ( b 2 − 3 a c ) 3 2 − 2 u b 3 27 a 2 .
Then, if φ ∗ m parameters satisfy Equations (14)–(17), then φ ∗ m on the interval p , q is chaotic.
2. When a < 0 ,
(1)
If b > 0 , using the same method, at this time, the range of u satisfies Equation (10) and θ satisfies Equation (12), i.e., θ = cos − 1 λ = cos − 1 ( 9 − 2 v − 9 u + 2 u v 2 v ( 1 − 3 v ) 3 2 − u ) .
Since a < 0 , it follows from the corollary that x 1 < x 3 < x 2 and m > m ∗ ; let p = x 3 = − b + D ⋅ 2 cos ( θ 3 − 2 3 π ) 3 a ,    q = x 2 = − b + D ⋅ 2 cos ( θ 3 + 2 3 π ) 3 a , so the function φ x is increasing on p , m and decreasing on m , q , and φ p = φ q = 0 .
Let the cubic function
φ ∗ x = a x 3 + b x 2 + c x + d ∗ .     a ≠ 0
Among them, d ∗ = d + p = u 9 a b c − 2 b 3 + 2 ( D ) 3 − 9 a b + 2 D cos ( θ 3 − 2 3 π ) 27 a 2 . Then, there clearly is φ p = φ q = p . Then, at this point, the function φ ∗ x is S single-peaked mapping.
In order to make φ ∗ x a chaotic mapping, we substitute D = b 2 − 3 a c into Equation (15) and let φ ∗ u , v m = q to obtain
φ ∗ u , v ( m ) = 2 b 3 + 3 b 2 b 2 − 3 a c − 9 a b c − ( b 2 − 3 a c ) 3 − 9 a c b 2 − 3 a c + 27 a 2 d ∗ 27 a 2 = ( 2 − 2 u ) b 3 + ( 3 b 2 − 9 a c ) b 2 − 3 a c − ( 9 u − 9 ) a b c − ( b 2 − 3 a c ) 3 27 a 2 + 2 u ( b 2 − 3 a c ) 3 − 9 a b + 18 a b 2 − 3 a c cos ( θ 3 − 2 3 π ) 27 a 2 = − 9 a b + 18 a b 2 − 3 a c cos ( θ 3 + 2 3 π ) 27 a 2 ,
2 − 2 u b 3 + 3 b 2 − 9 a c b 2 − 3 a c − 9 u − 9 a b c − ( b 2 − 3 a c ) 3 + 2 u ( b 2 − 3 a c ) 3 27 a 2 = 18 a b 2 − 3 a c cos ( θ 3 + 2 3 π ) 27 a 2 − 18 a b 2 − 3 a c cos ( θ 3 − 2 3 π ) 27 a 2 .
Then, by b 2 = v a c , it follows that
2 − 2 u b 3 + b 3 3 − 9 v b 2 − 3 a c − 9 u − 9 v b 3 − b 3 1 − 3 v 3 2 + 2 u b 3 1 − 3 v 3 2 = 18 a b 1 − 3 v ( cos ( θ 3 + 2 3 π ) − cos ( θ 3 − 2 3 π ) ) .
Since b > 0 , it follows that
b = 18 a 1 − 3 v cos ( θ 3 + 2 3 π ) − cos ( θ 3 − 2 3 π ) 2 − 2 u + 3 − 9 v 1 − 3 v + 9 u − 9 v + 2 u − 1 ( 1 − 3 v ) 3 2 ,
d ∗ = 9 a b u c − 1 + 18 a b 2 − 3 a c cos ( θ 3 − 2 3 π ) + 2 u ( b 2 − 3 a c ) 3 2 − 2 u b 3 27 a 2 .
If the parameters of φ ∗ m satisfy Equations (10), (12), (32) and (33), then φ ∗ m is chaotic on the interval p , q .
(2)
If b < 0 , then the range of u satisfies Equation (21), θ satisfies Equation (22), and φ ∗ x is S single-peaked mapping.
In order to make φ ∗ x a chaotic mapping, we substitute D = b 2 − 3 a c into Equation (15) and let φ ∗ u , v m = q to obtain
φ ∗ u , v ( m ) = 2 b 3 + 3 b 2 b 2 − 3 a c − 9 a b c − ( b 2 − 3 a c ) 3 − 9 a c b 2 − 3 a c + 27 a 2 d ∗ 27 a 2 = ( 2 − 2 u ) b 3 + ( 3 b 2 − 9 a c ) b 2 − 3 a c − ( 9 u − 9 ) a b c − ( b 2 − 3 a c ) 3 27 a 2 + 2 u ( b 2 − 3 a c ) 3 − 9 a b + 18 a b 2 − 3 a c cos ( θ 3 − 2 3 π ) 27 a 2 = − 9 a b + 18 a b 2 − 3 a c cos ( θ 3 + 2 3 π ) 27 a 2 ,
2 − 2 u b 3 + 3 b 2 − 9 a c b 2 − 3 a c − 9 u − 9 a b c − ( b 2 − 3 a c ) 3 + 2 u ( b 2 − 3 a c ) 3 27 a 2 = 18 a b 2 − 3 a c cos ( θ 3 + 2 3 π ) − 18 a b 2 − 3 a c cos ( θ 3 − 2 3 π ) 27 a 2
Then, by b 2 = v a c , it follows that
2 − 2 u b 3 + b 3 3 − 9 v b 2 − 3 a c − 9 u − 9 v b 3 − b 3 ( 1 − 3 v ) 3 2 + 2 u b 3 ( 1 − 3 v ) 3 2 = 18 a b 1 − 3 v cos ( θ 3 + 2 3 π ) − cos ( θ 3 − 2 3 π ) .
Since b < 0 , it follows that
b = − 18 a 1 − 3 v cos ( θ 3 − 2 3 π ) − cos ( θ 3 + 2 3 π ) 2 − 2 u − 3 − 9 v 1 − 3 v + 9 u − 9 v − 2 u − 1 ( 1 − 3 v ) 3 2 ,
d ∗ = 9 a b u c − 1 + 18 a b 2 − 3 a c cos ( θ 3 − 2 3 π ) + 2 u ( b 2 − 3 a c ) 3 2 − 2 u b 3 27 a 2
If the parameters of φ ∗ m satisfy Equations (21), (22), (37) and (38), then φ ∗ m on the interval p , q is chaotic.
As above, all sign cases of the parameters are considered, so that the cubic polynomial discrete chaos determination theorem can be given.
Theorem 3.
Let the cubic function be
φ x = a x 3 + b x 2 + c x + d    a ≠ 0 .
Let  b 2 = v a c ,  v ∈ − ∞ , 0 ∪ 3 , + ∞ , then  φ x   is a chaotic mapping if the set of parameters  S = a , u , v , d , θ   satisfies any of the following cases.
Condition (1): If  a > 0 ,
Case (i)
1 − 4 ( 1 − 3 v ) 3 2 9 v − 2 + 2 ( 1 − 3 v ) 3 2 ≤ u ≤ 1 , b = 18 a 1 − 3 v cos ( θ 3 − 2 3 π ) − cos ( θ 3 + 2 3 π ) 2 − 2 u + 3 − 9 v 1 − 3 v + 9 u − 9 v + 2 u − 1 ( 1 − 3 v ) 3 2 , d = 9 a b u c − 1 + 18 a b 2 − 3 a c cos ( θ 3 + 2 3 π ) + 2 u ( b 2 − 3 a c ) 3 2 − 2 u b 3 27 a 2 , θ = cos − 1 ( 9 − 2 v − 9 u + 2 u v 2 v ( 1 − 3 v   ) 3 2 − u ) .
Case (ii)
1 + 4 ( 1 − 3 v ) 3 2 9 v − 2 − 2 ( 1 − 3 v ) 3 2 ≤ u ≤ 1 , b = − 18 a 1 − 3 v cos ( θ 3 + 2 3 π ) − cos ( θ 3 − 2 3 π ) 2 − 2 u − 3 − 9 v 1 − 3 v + 9 u − 9 v − 2 u − 1 ( 1 − 3 v ) 3 2 , d = 9 a b u c − 1 + 18 a b 2 − 3 a c cos ( θ 3 + 2 3 π ) + 2 u ( b 2 − 3 a c ) 3 2 − 2 u b 3 27 a 2 , θ = cos − 1 ( 9 − 2 v − 9 u + 2 u v − 2 v ( 1 − 3 v ) 3 2 − u ) .
Then,  φ x :   J = p , q → J  is a single-peaked mapping, where  p = − b 3 a + 2 b 2 − 3 a c cos ( θ 3 + 2 3 π ) 3 a ,  q = − b + 2 b 2 − 3 a c cos ( θ 3 − 2 3 π ) 3 a , and there exists a point  m = − b − b 2 − 3 a c 3 a ∈ p , q  such that  φ m = q .
Condition (2): If  a < 0 ,
Case (i)
1 − 4 ( 1 − 3 v ) 3 2 9 v − 2 + 2 ( 1 − 3 v ) 3 2 ≤ u ≤ 1 , b = 18 a 1 − 3 v cos ( θ 3 + 2 3 π ) − cos ( θ 3 − 2 3 π ) 2 − 2 u + 3 − 9 v 1 − 3 v + 9 u − 9 v + 2 u − 1 ( 1 − 3 v ) 3 2 , d = 9 a b u c − 1 + 18 a b 2 − 3 a c cos ( θ 3 − 2 3 π ) + 2 u ( b 2 − 3 a c ) 3 2 − 2 u b 3 27 a 2 , θ = cos − 1 ( 9 − 2 v − 9 u + 2 u v 2 v ( 1 − 3 v ) 3 2 − u ) .
Case (ii)
1 + 4 ( 1 − 3 v ) 3 2 9 v − 2 − 2 ( 1 − 3 v ) 3 2 ≤ u ≤ 1 , b = − 18 a 1 − 3 v cos ( θ 3 − 2 3 π ) − cos ( θ 3 + 2 3 π ) 2 − 2 u − 3 − 9 v 1 − 3 v + 9 u − 9 v − 2 u − 1 ( 1 − 3 v ) 3 2 , d = 9 a b u c − 1 + 18 a b 2 − 3 a c cos ( θ 3 − 2 3 π ) + 2 u ( b 2 − 3 a c ) 3 2 − 2 u b 3 27 a 2 , θ = cos − 1 ( 9 − 2 v − 9 u + 2 u v − 2 v ( 1 − 3 v ) 3 2 − u ) .
Then,  φ x :  J = p , q → J  is a single-peaked mapping, where  p = − b 3 a + 2 b 2 − 3 a c cos ( θ 3 − 2 3 π ) 3 a ,  q = − b + 2 b 2 − 3 a c cos ( θ 3 + 2 3 π ) 3 a , and there exists a point  m = − b − b 2 − 3 a c 3 a ∈ p , q  such that  φ m = q .
Based on the general form of the cubic chaotic mapping given above (Theorem 3), Matlab R2024b is used to verify whether the iterative sequence has chaotic properties if the parameters satisfy any of the cases in the theorem. Since the simulation case of v > 0 and v < 0 are similar, only the case of whether chaos can be generated when v > 0 is verified here.
Construct the cubic chaotic mapping as
x n + 1 = a x n 3 + b x n 2 + c x n + d .
Take the parameters a = 4 and v = 5 , respectively, and substitute them into the two cases of condition (1) of Theorem 3. The calculation can be obtained in case (i) − 2.3073 ≤ u ≤ 1 ; in case (ii), − 0 . 4334 ≤ u ≤ 1 . Here, we take u = 0.4 , and the results of substituting the three parameters into condition (1) are shown in Table 1, and the function graph and the chaotic scatter plot of x n obtained from n = 10 , 000 iterations are shown in Figure 1.
Table 1. Calculated results of the parameters of the three mappings under condition (1).
Figure 1. The cubic chaos mapping under condition (1): (a) Case (i) function graph; (b) scatter plot of the case (i) at x 0 = − 1 ; (c) case (ii) function graph; (d) scatter plot of case (ii) at x 0 = 0 .
Take the parameters a = − 3 and v = 5 , respectively, and substitute them into the two cases of condition (2) of Theorem 3. The calculation can be obtained in case (i) − 2.3073 ≤ u ≤ 1 ; in case (ii), − 0 . 4334 ≤ u ≤ 1 . So here, we still take u = 0.4 , the calculation results by substituting the three parameters into condition (2) are shown in Table 2, and the function graph and the chaotic scatter plot of x n obtained by n = 10 , 000 iterations are shown in Figure 2.
Table 2. Calculation results of three mapping parameters under condition (2).
Figure 2. The cubic chaos mapping under condition (2): (a) Case (i) function plot; (b) scatter plot of the case (i) at x 0 = 1 ; (c) case (ii) function plot; (d) scatter plot of the case (ii) at x 0 = 0 .
From Figure 1 and Figure 2, it can be seen that v > 3 . If the parameters satisfy any of the conditions of Theorem 3, the chaotic phenomenon is generated in the interval p , q , so the chaotic system has good ergodicity, as well as unpredictability.

3. An Improved Chaotic Mapping

Here, we introduce a one-dimensional iterative chaotic folding mapping (ICMIC) [30].
x n + 1 = f m , x n = sin m x n
− 1 ≤ x n ≤ 1     x 0 ≠ 0
m ∈ 0 , + ∞     n = 0 , 1 , 2 , …
where m is an adjustable parameter. Since the simple chaotic mapping still has nonlinear dynamic behavior after the multiplication operation, we propose an improved chaotic mapping with the expression
x n = sin m a f ( x n − 1 ) 3 + b f ( x n − 1 ) 2 + c f x n − 1 + d
where m ∈ 0 , + ∞ , the f is a segmented function, and the chaotic intervals are p 1 , q 1 .
f x = p + x − p x − q q − p , x < p , x , p ≤ x ≤ q , p + x − q x − p q − p , x > q ;
where a , b , c , d ∈ R satisfies Theorem 3.
The dynamics analysis of chaotic systems is of great application. In this section, scatter diagrams, histograms, bifurcation diagrams, complexity analysis, and Lyapunov exponent are chosen to measure the properties of chaotic systems.
In this section, take each parameter as a = 14 , b = 11 . 3923 , c = 0 . 9270 , d = − 0.7153 , v = 10 , and u = 0.4 . The calculation gives p = − 0 . 7233 and q = − 0 . 0807 , taking the initial value x = − 1 and substituting them into Equation (46) for 20,000 iterations.

3.1. Lyapunov Exponent and Bifurcation

The Lyapunov exponent is an index that describes the stability of a dynamical system. The Lyapunov exponent can be used to measure the exponential growth rate between two adjacent trajectories in a dynamical system. The larger it is, the stronger and more unstable the chaotic nature of the system. Figure 3a shows the Lyapunov exponent plots of system (46), the ICMIC system, and Logistic map with respect to the state variable m . When the Lyapunov exponent is greater than 0, it indicates that the system is chaotic. From the graph, it can be seen that system (46) enters the chaotic state from m = 0 . 12 . However, the ICMIC system enters the chaotic state only after m = 1 . 82 . Thus, system (46) exhibits a larger chaotic range and a larger Lyapunov exponent. A bifurcation diagram is a graph used to describe the stability and chaotic nature of a dynamical system. In the bifurcation diagram, we can observe the different stability and periodicity of the system states, as well as the bifurcation phenomena that occur as the parameter values change. Figure 3b shows the bifurcation diagram with respect to the state variable m . From the figure, it can be seen that system (46) has a relatively uniform chaotic region and a small period window, reflecting its better chaotic characteristics. Combining Figure 3a,b, it can be concluded that, compared with ICMIC mapping, the newly constructed chaotic mapping has a wider range of parameters and stronger chaotic properties.
Figure 3. (a) Lyapunov exponent diagram. (b) Bifurcation diagram.
Figure 4 shows the two-parameter Lyapunov exponential diagram of system (46) with respect to the parameters m and a 1 . The system has more non-chaotic regions in Figure 4a and fewer non-chaotic regions in Figure 4b. In Figure 4c, almost all of them are chaotic regions. This indicates that the chaotic characteristics of the chaotic mapping under the control of parameters m and a are stronger with the increase in v .
Figure 4. Two-parameter Lyapunov exponent diagram about a and m (a) when v = 4 ; (b) when v = 5 ; (c) when v = 10 .

3.2. Trajectory and Scatter Plots

The initial value sensitivity of chaotic systems refers to the fact that small changes in the initial conditions may lead to significant differences in the evolution of the system. To analyze the initial value sensitivity of the chaotic system, we plotted the initial value sensitivity trajectory. Figure 5a shows a plot of the initial value sensitivity trajectory of system (46) for an initial value deviation of 0.00001 and m = 50 . Even if the initial value changes by only 0.00001, the trajectory of the system still varies significantly. Chaotic scatter diagrams demonstrate the nonlinear and unpredictable nature of chaotic systems by presenting their states as scatter diagrams. Figure 5b shows the scatter plot of system (46) at m = 50 , from which the ergodic and random nature of this chaotic system can be seen.
Figure 5. (a) Trajectory plot. (b) Scatter plot.

3.3. Spectral Entropy (SE) Analysis

SE is an algorithm used to evaluate the complexity of chaotic systems, and its results reflect the randomness and complexity of the dynamical behavior of chaotic systems. The SE algorithm is based on the method of spectral analysis, where the power spectrum of a signal is obtained in a certain frequency band and its SE is calculated. Figure 6 shows the SE plots of system (46) and the ICMIC system with respect to the state variable m . As shown in the figure, the spectral entropy (SE) complexity curve of the ICMIC system exhibits significant fluctuations, with limited stable intervals. The SE of system (46) fluctuates in a relatively stable manner in the interval 1.48 , 3.18 and 3.36 , 5 in small increments. On the interval 0 , 5 , the SE value of system (46) is similar in size to that of the ICMIC system, but the SE value of system (46) is less volatile. Therefore, system (46) has a better stability in SE complexity. In cryptography, larger SE complexity can provide higher randomness and unpredictability and increase the resistance of cryptographic algorithms. However, in control systems or communication systems, larger SE complexity may lead to instability or uncontrollability of the system. In this case, stability and controllability are more important, so chaotic mapping with moderate SE complexity needs to be selected. It is important to note that a stable SE complexity does not mean that the system lacks complexity or randomness. Stable SE complexity simply means that the system is moderately sensitive to changes in initial conditions and parameters, and it is able to maintain a certain degree of complexity as well as the stability and controllability of the system. It can be seen that system (46) is more suitable for application in control systems or communication systems.
Figure 6. SE complexity diagram.

3.4. 0–1 Test

For system (46) with fixed parameters and initial values, we conduct the 0–1 test for chaos, with comparative analysis against ICMIC and the standard Logistic map. Figure 6 presents the phase diagrams for both systems.
Figure 7 reveals that the phase diagrams for system (46) exhibit Brownian-like motion with significantly greater complexity than those of ICMIC and the Logistic map. Table 3 presents the results of spectral entropy (SE) and 0–1 test for system (46), ICMIC, and the Logistic map. The data further confirm the superior chaotic performance of system (46) over ICMIC and the Logistic map.
Figure 7. The p , s phase diagrams. (a). New Chaos. (b). ICMIC. (c). Logistic map.
Table 3. The results of SE and 0–1 test for system (46), ICMIC, and the Logistic map.

4. Conclusions

This paper first establishes and rigorously proves a robust chaos criterion for a class of cubic chaotic maps in the real number field. Theoretical analysis and numerical simulations confirm that the constructed maps can generate highly complex chaotic sequences with good pseudo-randomness. Secondly, by combining the structure of the infinite folding map, a novel one-dimensional discrete chaotic map is proposed. Through systematic evaluation using various dynamical analysis tools—including Lyapunov exponents, bifurcation diagrams, and spectral entropy complexity—the new map is shown to outperform traditional maps in terms of chaotic range, sensitivity to initial conditions, and sequence randomness. This study provides a clearly structured and dynamically superior mapping model for designing high-security chaotic cryptosystems, contributing positively to the application of chaos-based encryption in practical communication and information security. Future work will further explore the performance and implementation optimization of this map in scenarios such as image encryption and lightweight cryptographic protocols.

Author Contributions

Software, X.C.; Validation, G.L. and W.X.; Formal analysis, X.C.; Investigation, W.X.; Resources, L.H.; Data curation, B.T.; Writing—review and editing, L.H. and G.L.; Supervision, G.L. and B.T.; Project administration, G.L. All authors have read and agreed to the published version of the manuscript.

Funding

This work was partially supported by the Science and Technology Project of Guangxi (Guike AD25069086).

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding authors.

Conflicts of Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

References

  1. May, R.M. Simple mathematical models with very complicated dynamics. Nature 1976, 261, 459–467. [Google Scholar] [CrossRef] [Scilit]
  2. Liao, G.; Wang, L. Almost periodicity, chain recurrence and chaos. Isr. J. Math. 1996, 93, 145–156. [Google Scholar] [CrossRef] [Scilit]
  3. Hoppe, V. Specification of geometrical parameters for elements with cubic mapping functions. Int. J. Numer. Methods Eng. 1973, 7, 94–98. [Google Scholar] [CrossRef] [Scilit]
  4. Zhao, H.; Xie, S.; Zhang, J.; Wu, T. A Dynamic Block Image Encryption Using Variable-Length Secret Key and Modified Henon. Map. Opt. 2021, 230, 166307. [Google Scholar] [CrossRef] [Scilit]
  5. Feng, W.; Tang, Z.; Zhao, X.; Qin, Z.; Chen, Y.; Cai, B.; Zhu, Z.; Qian, K.; Wen, H. Two-Dimensional Coupling-Enhanced Cubic Hyperchaotic Map with Exponential Parameters: Construction, Analysis, and Application in Hierarchical Significance-Aware Multi-Image Encryption. Axioms 2025, 14, 901. [Google Scholar] [CrossRef] [Scilit]
  6. Sun, J. 2D-SCMCI Hyperchaotic Map for Image Encryption Algorithm. IEEE Access 2021, 9, 59313–59327. [Google Scholar] [CrossRef] [Scilit]
  7. Elrefai, H.M.; Sayed, W.S.; Said, L.A. Hardware-based audio encryption system using two-dimensional chaotic maps. Electronics 2024, 13, 4254. [Google Scholar] [CrossRef] [Scilit]
  8. Alexan, W.; El Shabasy, N.H.; Ehab, N.; Mohamed, A. A chaos-based augmented image encryption scheme for satellite images using Fredkin logic. Sci. Rep. 2025, 15, 22008. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  9. Mansoor, S.; Sarosh, P.; Ali, R.; Khan, M.A. Adaptive color image encryption using multiple distinct chaotic maps and DNA computing. Mathematics 2022, 10, 2004. [Google Scholar] [CrossRef] [Scilit]
  10. Kwok, H.S.; Tang, W.K. A fast image encryption system based on chaotic maps with an improved diffusion mechanism. Chaos Solitons Fractals 2007, 32, 1518–1529. [Google Scholar] [CrossRef] [Scilit]
  11. Li, C.; Xie, T.; Liu, Q. Cryptanalyzing image encryption using chaotic logistic map. arXiv 2013, arXiv:1301.4089. [Google Scholar] [CrossRef] [Scilit]
  12. Feng, W.; Tang, Z.; Zhao, X.; Qin, Z.; Chen, Y.; Cai, B.; Zhu, Z.; Wen, H.; Ye, C. State-Dependent Variable Fractional-Order Hyperchaotic Dynamics in a Coupled Quadratic Map: A Novel System for High-Performance Image Protection. Fractal Fract. 2025, 9, 792. [Google Scholar] [CrossRef] [Scilit]
  13. Machicao, J.; Alves, M.; Brunnet, L.G. Exploiting ergodicity of logistic map using deep-zoom to improve chaos-based cryptosystems. arXiv 2018, arXiv:1808.02949. [Google Scholar] [CrossRef] [Scilit]
  14. Kocarev, L.; Jakimoski, G. Logistic map as a block encryption algorithm. Phys. Lett. A 2001, 289, 199–206. [Google Scholar] [CrossRef] [Scilit]
  15. Song, X.; Xu, D.; Li, G.; Xu, W. Multi-image reorganization encryption based on SLF cascade chaos and bit scrambling. J. Web Eng. 2021, 20, 1177–1192. [Google Scholar] [CrossRef] [Scilit]
  16. Alawida, M. Enhancing logistic chaotic map for improved cryptographic security in random number generation. J. Inf. Secur. Appl. 2024, 80, 103685. [Google Scholar] [CrossRef] [Scilit]
  17. Hosny, K.M.; Elnabawy, Y.M.; Salama, R.A.; Elshewey, A.M. Multiple image encryption algorithm using channel randomization and multiple chaotic maps. Sci. Rep. 2024, 14, 30597. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  18. Fedoseev, P.; Pesterev, D.; Rozhkov, V.; Rybin, V.; Butusov, D. Chaotic encryption algorithm based on Gingerbreadman map with adaptive symmetry. Chaos Theory Appl. 2025, 7, 31–41. [Google Scholar] [CrossRef] [Scilit]
  19. Kopp, M.; Samuilik, I. Dynamical analysis and adaptive synchronization of a new 6D hyperchaotic system with the cosine function. Math. Model. Anal. 2025, 30, 626–644. [Google Scholar] [CrossRef] [Scilit]
  20. Huang, G.C. Efficient parameter search for chaotic dynamical systems using reinforcement learning. Symmetry 2025, 17, 1832. [Google Scholar] [CrossRef] [Scilit]
  21. Xu, J.; Li, C.; Cen, X.; Zhang, X.; Chai, L. Chaos regulation via complex nonlinear feedback and its implementation based on FPAA. Symmetry 2025, 17, 212. [Google Scholar] [CrossRef] [Scilit]
  22. Yu, F.; Kong, X.; Yao, W.; Zhang, J.; Cai, S.; Lin, H.; Jin, J. Dynamics analysis, synchronization and FPGA implementation of multiscroll Hopfield neural networks with non-polynomial memristor. Chaos Solitons Fractals 2024, 179, 114440. [Google Scholar] [CrossRef] [Scilit]
  23. Weissenbacher, M.; Borovykh, A.; Rigas, G. Reinforcement learning of chaotic systems control in partially observable environments. Flow Turbul. Combust. 2025, 115, 1357–1378. [Google Scholar] [CrossRef] [Scilit]
  24. An, X.; Li, D.; Li, J. An improved chaos control with adaptive active set approach combined in reliability-based design optimization. Sci. Rep. 2025, 15, 42790. [Google Scholar] [CrossRef] [Scilit]
  25. Rojas-Galván, R.; Mercado-Gutiérrez, E.; Tlelo-Cuautle, E. Optimizing chaotic systems by orbit counting and Fourier spectrum: FPGA implementation and image encryption application. Math. Model. Anal. 2025, 30, 322–341. [Google Scholar] [CrossRef] [Scilit]
  26. Al-Barakati, A.A.; Mesdoui, F.; Bekiros, S.; Kaçar, S.; Jahanshahi, H. A variable-order fractional memristor neural network: Secure image encryption and synchronization via a smooth and robust control approach. Chaos Solitons Fractals 2024, 186, 115135. [Google Scholar] [CrossRef] [Scilit]
  27. Xu, W.; Chen, X.; Zhou, Z.; Li, G.; Song, X. General construction method and proof for a class of quadratic chaotic mappings. Mathematics 2025, 13, 2409. [Google Scholar] [CrossRef] [Scilit]
  28. Qi, C.; Bi, Y.; Han, H.; Li, Y. A hybrid particle swarm optimization algorithm. In Proceedings of the 2017 3rd IEEE International Conference on Computer and Communications (ICCC); IEEE: Piscataway, NJ, USA, 2017; pp. 2187–2190. [Google Scholar] [CrossRef] [Scilit]
  29. Andrecut, M.; Ali, M.K. Robust chaos in smooth unimodal maps. Phys. Rev. E 2001, 64, 025203. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  30. He, D.; He, C.; Jiang, L.G.; Zhu, H.W.; Hu, G.R. Chaotic characteristics of a one-dimensional iterative map with infinite collapses. IEEE Trans. Circuits Syst. I Fundam. Theory Appl. 2001, 48, 900–906. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.