scholarly journals Reducing the Dynamical Degradation of Digital Chaotic Maps with Time-Delay Linear Feedback and Parameter Perturbation

2020 ◽  
Vol 2020 ◽  
pp. 1-12 ◽  
Author(s):  
Bocheng Liu ◽  
Hongyue Xiang ◽  
Lingfeng Liu
Keyword(s):  
Time Delay ◽  
Chaotic Maps ◽  
Complexity Analysis ◽  
Chaotic Map ◽  
Logistic Map ◽  
Numerical Results ◽  
Linear Feedback ◽  
Parameter Perturbation ◽  
Dynamical Degradation ◽  
Baker Map

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.

A Double Perturbation Method for Reducing Dynamical Degradation of the Digital Baker Map

2017 ◽  
Vol 27 (07) ◽  
pp. 1750103 ◽  
Author(s):  
Lingfeng Liu ◽  
Jun Lin ◽  
Suoxia Miao ◽  
Bocheng Liu
Keyword(s):  
Perturbation Method ◽  
Image Encryption ◽  
Chaotic Map ◽  
Logistic Map ◽  
Simple Algorithm ◽  
Low Complexity ◽  
State Variables ◽  
Dynamical Degradation ◽  
Precision Device ◽  
Baker Map

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.

scholarly journals A Novel S-Box Dynamic Design Based on Nonlinear-Transform of 1D Chaotic Maps

Electronics ◽  
2021 ◽  
Vol 10 (11) ◽  
pp. 1313
Author(s):  
Wenhao Yan ◽  
Qun Ding
Keyword(s):  
Chaotic Systems ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Logistic Map ◽  
Sample Entropy ◽  
One Dimension ◽  
Linear Combinations ◽  
Dynamic Design ◽  
Construction Methods ◽  
Low Dimensional

In this paper, a method to enhance the dynamic characteristics of one-dimension (1D) chaotic maps is first presented. Linear combinations and nonlinear transform based on existing chaotic systems (LNECS) are introduced. Then, a numerical chaotic map (LCLS), based on Logistic map and Sine map, is given. Through the analysis of a bifurcation diagram, Lyapunov exponent (LE), and Sample entropy (SE), we can see that CLS has overcome the shortcomings of a low-dimensional chaotic system and can be used in the field of cryptology. In addition, the construction of eight functions is designed to obtain an S-box. Finally, five security criteria of the S-box are shown, which indicate the S-box based on the proposed in this paper has strong encryption characteristics. The research of this paper is helpful for the development of cryptography study such as dynamic construction methods based on chaotic systems.

scholarly journals An Investigation into the Performance of Particle Swarm Optimization with Various Chaotic Maps

2014 ◽  
Vol 2014 ◽  
pp. 1-17 ◽  
Author(s):  
Akugbe Martins Arasomwan ◽  
Aderemi Oluyinka Adewumi
Keyword(s):  
Particle Swarm Optimization ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Logistic Map ◽  
Particle Swarm ◽  
Test Problems ◽  
Swarm Optimization ◽  
Inertia Weight ◽  
Mathematical Problems ◽  
Logistic Chaotic Map

This paper experimentally investigates the effect of nine chaotic maps on the performance of two Particle Swarm Optimization (PSO) variants, namely, Random Inertia Weight PSO (RIW-PSO) and Linear Decreasing Inertia Weight PSO (LDIW-PSO) algorithms. The applications of logistic chaotic map by researchers to these variants have led to Chaotic Random Inertia Weight PSO (CRIW-PSO) and Chaotic Linear Decreasing Inertia Weight PSO (CDIW-PSO) with improved optimizing capability due to better global search mobility. However, there are many other chaotic maps in literature which could perhaps enhance the performances of RIW-PSO and LDIW-PSO more than logistic map. Some benchmark mathematical problems well-studied in literature were used to verify the performances of RIW-PSO and LDIW-PSO variants using the nine chaotic maps in comparison with logistic chaotic map. Results show that the performances of these two variants were improved more by many of the chaotic maps than by logistic map in many of the test problems. The best performance, in terms of function evaluations, was obtained by the two variants using Intermittency chaotic map. Results in this paper provide a platform for informative decision making when selecting chaotic maps to be used in the inertia weight formula of LDIW-PSO and RIW-PSO.

scholarly journals An Iteration-Time Combination Method to Reduce the Dynamic Degradation of Digital Chaotic Maps

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Yao Wu ◽  
Lingfeng Liu
Keyword(s):  
Chaotic Maps ◽  
Control Function ◽  
Chaotic Map ◽  
Combination Method ◽  
Control Parameters ◽  
Improved Method ◽  
Dynamical Degradation ◽  
Dynamic Degradation ◽  
Number Of Iterations ◽  
Iteration Time

A new and improved method based on the number of iterations is proposed to reduce the dynamical degradation of the digital chaotic map in this study. We construct a control function by introducing iteration time instead of external systems, thereby replacing the control parameters in the original chaotic map. Experimental results show that the chaotic map based on the iteration-time combination method is more complicated and effective. The period is extended without completely destroying the phase space, which indicates that our method is effective and can compete with other proposed techniques. A type of pseudorandom bit generator based on the iteration-time combination method is proposed to demonstrate its simple application.

scholarly journals Speech encryption by multiple chaotic map with fast fourier transform

2020 ◽  
Vol 10 (6) ◽  
pp. 5658
Author(s):  
Yahia Alemami ◽  
Mohamad Afendee Mohamed ◽  
Saleh Atiewi ◽  
Mustafa Mamat
Keyword(s):  
Social Communication ◽  
Data Security ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Logistic Map ◽  
The Other ◽  
Mathematical Structures ◽  
Multiple Encryption ◽  
Encryption Algorithms ◽  
Speech Encryption

There are various ways of social communication including writing (WhatsApp, Messenger, Facebook, Twitter, Skype, etc), calling (mobile phone) and voice recording (record your voice and then send it to the other party), but there are ways to eavesdropping the calls and voice messages, One way to solve this problem is via cryptographic approach. Chaos cryptography build on top of nonlinear dynamics chaotic system has gained some footstep in data security. It provides an alternative to conventional cryptography built on top of mathematical structures. This research focuses on the protection of speech recording by encrypting it with multiple encryption algorithms, including chaotic maps (Logistic Map and Sine Maps).

scholarly journals A Nonlinearly Modulated Logistic Map With Delay for Image Encryption

Electronics ◽  
2018 ◽  
Vol 7 (11) ◽  
pp. 326 ◽  
Author(s):  
Shouliang Li ◽  
Benshun Yin ◽  
Weikang Ding ◽  
Tongfeng Zhang ◽  
Yide Ma
Keyword(s):  
Lyapunov Exponents ◽  
Image Encryption ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Logistic Map ◽  
Delay Model ◽  
Test Results ◽  
Bit Plane ◽  
Differential Attacks ◽  
Image Encryption Algorithm

Considering that a majority of the traditional one-dimensional discrete chaotic maps have disadvantages including a relatively narrow chaotic range, smaller Lyapunov exponents, and excessive periodic windows, a new nonlinearly modulated Logistic map with delay model (NMLD) is proposed. Accordingly, a chaotic map called a first-order Feigenbaum-Logistic NMLD (FL-NMLD) is proposed. Simulation results demonstrate that FL-NMLD has a considerably wider chaotic range, larger Lyapunov exponents, and superior ergodicity compared with existing chaotic maps. Based on FL-NMLD, we propose a new image encryption algorithm that joins the pixel plane and bit-plane shuffle (JPB). The simulation and test results confirm that JPB has higher security than simple pixel-plane encryption and is faster than simple bit-plane encryption. Moreover, it can resist the majority of attacks including statistical and differential attacks.

scholarly journals The Design and FPGA-Based Implementation of a Stream Cipher Based on a Secure Chaotic Generator

2021 ◽  
Vol 11 (2) ◽  
pp. 625
Author(s):  
Fethi Dridi ◽  
Safwan El Assad ◽  
Wajih El Hadj Youssef ◽  
Mohsen Machhout ◽  
René Lozi
Keyword(s):  
Stream Cipher ◽  
Chaotic Maps ◽  
Statistical Tests ◽  
Chaotic Map ◽  
Logistic Map ◽  
Tent Map ◽  
First Order ◽  
Recursive Filters ◽  
Weakly Coupled ◽  
Chebyshev Map

In this study, with an FPGA-board using VHDL, we designed a secure chaos-based stream cipher (SCbSC), and we evaluated its hardware implementation performance in terms of computational complexity and its security. The fundamental element of the system is the proposed secure pseudo-chaotic number generator (SPCNG). The architecture of the proposed SPCNG includes three first-order recursive filters, each containing a discrete chaotic map and a mixing technique using an internal pseudo-random number (PRN). The three discrete chaotic maps, namely, the 3D Chebyshev map (3D Ch), the 1D logistic map (L), and the 1D skew-tent map (S), are weakly coupled by a predefined coupling matrix M. The mixing technique combined with the weak coupling technique of the three chaotic maps allows preserving the system against side-channel attacks (SCAs). The proposed system was implemented on a Xilinx XC7Z020 PYNQ-Z2 FPGA platform. Logic resources, throughput, and cryptanalytic and statistical tests showed a good tradeoff between efficiency and security. Thus, the proposed SCbSC can be used as a secure stream cipher.

scholarly journals Designing 1D Chaotic Maps for Fast Chaotic Image Encryption

Electronics ◽  
2021 ◽  
Vol 10 (17) ◽  
pp. 2116
Author(s):  
Mustafa Kamil Khairullah ◽  
Ammar Ahmed Alkahtani ◽  
Mohd Zafri Bin Bin Baharuddin ◽  
Ammar Al-Jubari
Keyword(s):  
Image Encryption ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Logistic Map ◽  
Expansion Method ◽  
Absolute Error ◽  
Change Rate ◽  
Quadratic Map ◽  
Encryption Method ◽  
Higher Sensitivity

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.

scholarly journals Fast and Secure Encryption System Based on a Chaotic Map

1970 ◽  
Vol 4 ◽  
pp. 59-60
Author(s):  
M. García-Bosque ◽  
C. Sánchez-Azqueta ◽  
S. Celma
Keyword(s):  
Stream Cipher ◽  
Chaotic Map ◽  
Logistic Map ◽  
Shift Register ◽  
Linear Feedback Shift Register ◽  
Linear Feedback ◽  
Modified Logistic Map ◽  
Feedback Shift Register

In this paper we propose a new fast and secure stream cipher based on a Modified Logistic Map and a Linear Feedback Shift Register.

Reducing the Dynamical Degradation by Bi-Coupling Digital Chaotic Maps

2018 ◽  
Vol 28 (05) ◽  
pp. 1850059 ◽  
Author(s):  
Lingfeng Liu ◽  
Bocheng Liu ◽  
Hanping Hu ◽  
Suoxia Miao
Keyword(s):  
Chaotic Maps ◽  
Chaotic Map ◽  
Coupled Model ◽  
The Other ◽  
Coupled Models ◽  
Digital Map ◽  
State Variable ◽  
Chebyshev Map ◽  
Chaotic Model ◽  
Dynamical Degradation

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.

Sign in / Sign up

Export Citation Format

Share Document