A chaotic map which is realized on a computer will suffer dynamical degradation. Here, a coupled chaotic model is proposed to reduce the dynamical degradation. In this model, the state variable of one digital chaotic map is used to control the parameter of the other digital map. This coupled model is universal and can be used for all chaotic maps. In this paper, two coupled models (one is coupled by two logistic maps, the other is coupled by Chebyshev map and Baker map) are performed, and the numerical experiments show that the performances of these two coupled chaotic maps are greatly improved. Furthermore, a simple pseudorandom bit generator (PRBG) based on coupled digital logistic maps is proposed as an application for our method.

The digital Baker map is widely used in different kinds of cryptosystems, especially for image encryption. However, any chaotic map which is realized on the finite precision device (e.g. computer) will suffer from dynamical degradation, which refers to short cycle lengths, low complexity and strong correlations. In this paper, a novel double perturbation method is proposed for reducing the dynamical degradation of the digital Baker map. Both state variables and system parameters are perturbed by the digital logistic map. Numerical experiments show that the perturbed Baker map can achieve good statistical and cryptographic properties. Furthermore, a new image encryption algorithm is provided as a simple application. With a rather simple algorithm, the encrypted image can achieve high security, which is competitive to the recently proposed image encryption algorithms.

No abstract

Digital chaotic maps are not secure enough for cryptographic applications due to their dynamical degradation. In order to improve their dynamics, in this paper, a novel method with time-delay linear feedback and parameter perturbation is proposed. The delayed state variable is used to construct the linear feedback function and parameter perturbation function. This method is universal for all different digital chaotic maps. Here, two examples are presented: one is 1D logistic map and the other is 2D Baker map. To show the effectiveness of this method, we take some numerical experiments, including trajectory and phase space analysis, correlation analysis, period analysis, and complexity analysis. All the numerical results prove that the method can greatly improve the dynamics of digital chaotic maps and is quite competitive with other proposed methods. Furthermore, a simple pseudorandom bit generator (PRBG) based on digital Baker map is proposed to show its potential application. The proposed PRBG is completely constructed by the digital chaotic map, without any other complex operations. Several numerical results indicate that this PRBG has good randomness and high complexity level.

No abstract