A Class of Quadratic Polynomial Chaotic Maps and Their Fixed Points Analysis

An Image Encryption Transmission Scheme Based on a Polynomial Chaotic Map

Most existing chaotic systems have many drawbacks in engineering applications, such as the discontinuous range of chaotic parameters, weak chaotic properties, uneven chaotic sequence outputs, and dynamic degradation. Therefore, based on the above, this paper proposes a new method for the design of a three-dimensional chaotic map. One can obtain the desired number of positive Lyapunov exponents, and can also obtain the desired value of positive Lyapunov exponents. Simulation results show that the proposed system has complex chaotic behavior and high complexity. Finally, the method is implemented into an image encryption transmission scheme and experimental results show that the proposed image encryption scheme can resist brute force attacks, correlation attacks, and differential attacks, so it has a higher security.

A Review on Applications of Chaotic Maps in Pseudo-Random Number Generators and Encryption

Because of the COVID-19 pandemic, most of the tasks have shifted to an online platform. Sectors such as e-commerce, sensitive multi-media transfer, online banking have skyrocketed. Because of this, there is an urgent need to develop highly secure algorithms which can not be hacked into by unauthorized users. The method which is the backbone for building encryption algorithms is the pseudo-random number generator based on chaotic maps. Chaotic maps are mathematical functions that generate a highly arbitrary pattern based on the initial seed value. This manuscript gives a summary of how the chaotic maps are used to generate pseudo-random numbers and perform multimedia encryption. After carefully analyzing all the recent literature, we found that the lowest correlation coefficient was 0.00006, which was achieved by Ikeda chaotic map. The highest entropy was 7.999995 bits per byte using the quantum chaotic map. The lowest execution time observed was 0.23 seconds with the Zaslavsky chaotic map and the highest data rate was 15.367 Mbits per second using a hyperchaotic map. Chaotic map-based pseudo-random number generation can be utilized in multi-media encryption, video-game animations, digital marketing, chaotic system simulation, chaotic missile systems, and other applications.

Designing 1D Chaotic Maps for Fast Chaotic Image Encryption

Chaotic maps that can provide highly secure key sequences and ease of structure implementation are predominant requirements in image encryption systems. One Dimensional (1D) chaotic maps have the advantage of a simple structure and can be easily implemented by software and hardware. However, key sequences produced by 1D chaotic maps are not adequately secure. Therefore, to improve the 1D chaotic maps sequence security, we propose two chaotic maps: 1D Improved Logistic Map (1D-ILM) and 1D Improved Quadratic Map (1D-IQM). The proposed maps have shown higher efficiency than existing maps in terms of Lyapunov exponent, complexity, wider chaotic range, and higher sensitivity. Additionally, we present an efficient and fast encryption method based on 1D-ILM and 1D-IQM to enhance image encryption system performance. This paper also introduces a key expansion method to reduce the number of chaotic map iteration needs, thereby decreasing encryption time. The security analyses and experimental results are confirmed that 2D Correlation Coefficient (CC) Information Entropy (IE), Number of Pixels Change Rate (NPCR), Unified Average Changing Intensity (UACI), Mean Absolute Error (MAE), and decryption quality are able to meet the encryption security demands (CC = −0.00139, IE = 7.9990, NPCR = 99.6114%, UACI = 33.46952% and MAE = 85.3473). Furthermore, the proposed keyspace reaches 10240, and the encryption time is 0.025s for an image with a size of 256 × 256. The proposed system can yield efficacious security results compared to obtained results from other encryption systems.

Image Encryption Scheme with Compressed Sensing Based on a New Six-Dimensional Non-Degenerate Discrete Hyperchaotic System and Plaintext-Related Scrambling

Digital images can be large in size and contain sensitive information that needs protection. Compression using compressed sensing performs well, but the measurement matrix directly affects the signal compression and reconstruction performance. The good cryptographic characteristics of chaotic systems mean that using one to construct the measurement matrix has obvious advantages. However, existing low-dimensional chaotic systems have low complexity and generate sequences with poor randomness. Hence, a new six-dimensional non-degenerate discrete hyperchaotic system with six positive Lyapunov exponents is proposed in this paper. Using this chaotic system to design the measurement matrix can improve the performance of image compression and reconstruction. Because image encryption using compressed sensing cannot resist known- and chosen-plaintext attacks, the chaotic system proposed in this paper is introduced into the compressed sensing encryption framework. A scrambling algorithm and two-way diffusion algorithm for the plaintext are used to encrypt the measured value matrix. The security of the encryption system is further improved by generating the SHA-256 value of the original image to calculate the initial conditions of the chaotic map. A simulation and performance analysis shows that the proposed image compression-encryption scheme has high compression and reconstruction performance and the ability to resist known- and chosen-plaintext attacks.

Nonlinear Dynamics and Entropy of Complex Systems with Hidden and Self-Excited Attractors II

According to the pioneering work of Leonov and Kuznetsov [...].

Low-Element Image Restoration Based on an Out-of-Order Elimination Algorithm

To reduce the consumption of receiving devices, a number of devices at the receiving end undergo low-element treatment (the number of devices at the receiving end is less than that at the transmitting ends). The underdetermined blind-source separation system is a classic low-element model at the receiving end. Blind signal extraction in an underdetermined system remains an ill-posed problem, as it is difficult to extract all the source signals. To realize fewer devices at the receiving end without information loss, this paper proposes an image restoration method for underdetermined blind-source separation based on an out-of-order elimination algorithm. Firstly, a chaotic system is used to perform hidden transmission of source signals, where the source signals can hardly be observed and confidentiality is guaranteed. Secondly, empirical mode decomposition is used to decompose and complement the missing observed signals, and the fast independent component analysis (FastICA) algorithm is used to obtain part of the source signals. Finally, all the source signals are successfully separated using the out-of-order elimination algorithm and the FastICA algorithm. The results show that the performance of the underdetermined blind separation algorithm is related to the configuration of the transceiver antenna. When the signal is 3 × 4 antenna configuration, the algorithm in this paper is superior to the comparison algorithm in signal recovery, and its separation performance is better for a lower degree of missing array elements. The end result is that the algorithms discussed in this paper can effectively and completely extract all the source signals.

Image Encryption Scheme with Compressed Sensing Based on New Three-Dimensional Chaotic System

In this paper, a new three-dimensional chaotic system is proposed for image encryption. The core of the encryption algorithm is the combination of chaotic system and compressed sensing, which can complete image encryption and compression at the same time. The Lyapunov exponent, bifurcation diagram and complexity of the new three-dimensional chaotic system are analyzed. The performance analysis shows that the chaotic system has two positive Lyapunov exponents and high complexity. In the encryption scheme, a new chaotic system is used as the measurement matrix for compressed sensing, and Arnold is used to scrambling the image further. The proposed method has better reconfiguration ability in the compressible range of the algorithm compared with other methods. The experimental results show that the proposed encryption scheme has good encryption effect and image compression capability.