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 Development of an enhanced scatter search algorithm using discrete chaotic Arnold’s cat map

2021 ◽  
Vol 6 (4 (114)) ◽  
pp. 15-20
Author(s):  
Amaal Ghazi Hamad Rafash ◽  
Enas Mohammed Hussein Saeed ◽  
Al-Sharify Mushtaq Talib
Keyword(s):  
Chaotic Maps ◽  
Search Algorithm ◽  
Chaotic Map ◽  
Scatter Search ◽  
Initial Point ◽  
Travelling Salesman ◽  
Arnold’S Cat Map ◽  
Scatter Search Algorithm ◽  
Map Search ◽  
Number Of Iterations

Solving optimization problems is an ever-growing subject with an enormous number of algorithms. Examples of such algorithms are Scatter Search (SS) and genetic algorithms. Modifying and improving of algorithms can be done by adding diversity and guidance to them. Chaotic maps are quite sensitive to the initial point, which means even a very slight change in the value of the initial point would result in a dramatic change of the sequence produced by the chaotic map Arnold's Cat Map. Arnold's Cat Map is a chaotic map technique that provides long non-repetitive random-like sequences.  Chaotic maps play an important role in improving evolutionary optimization algorithms and meta-heuristics by avoiding local optima and speeding up the convergence. This paper proposes an implementation of the scatter search algorithm with travelling salesman as a case study, then implements and compares the developed hyper Scatter Arnold's Cat Map Search (SACMS) method against the traditional Scatter Search Algorithm. SACMS is a hyper Scatter Search Algorithm with Arnold's Cat Map Chaotic Algorithm. Scatter Arnold's Cat Map Search shows promising results by decreasing the number of iterations required by the Scatter Search Algorithm to get an optimal solution(s). Travelling Salesman Problem, which is a popular and well-known optimization example, is implemented in this paper to demonstrate the results of the modified algorithm Scatter Arnold's Cat Map Search (SACMS). Implementation of both algorithms is done with the same parameters: population size, number of cities, maximum number of iterations, reference set size, etc. The results show improvement by the modified algorithm in terms of the number of iterations required by SS with an iteration reduction of 10–46 % and improvements in time to obtain solutions with 65 % time reduction

scholarly journals CHAOTIC CRYPTOGRAPHIC SCHEME BASED ON COMPOSITION MAPS

2008 ◽  
Vol 18 (01) ◽  
pp. 251-261 ◽  
Author(s):  
SOHRAB BEHNIA ◽  
AFSHIN AKHSHANI ◽  
HADI MAHMODI ◽  
AMIR AKHAVAN
Keyword(s):  
Invariant Measure ◽  
Diffusion Process ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Control Parameters ◽  
Chaotic Region ◽  
Key Space ◽  
Image Pixels ◽  
High Level ◽  
Cryptographic Scheme

In recent years, a growing number of cryptosystems based on chaos have been proposed. But most of them have encountered many problems such as small key space and weak security. In the present paper, a new kind of chaotic cryptosystem based on Composition of Trigonometric Chaotic Maps is proposed. These maps which are defined as ratios of polynomials of degree N, have interesting properties such as invariant measure, ergodicity, variable chaotic region with respect to the control parameters and ability to construct composition form of maps. We have used a composition of chaotic map to shuffle the position of image pixels. Another composition of chaotic map is used in diffusion process. According to the performed analysis, the introduced algorithm can satisfy the required performances such as high level security, large key space and the acceptable encryption speed.

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.

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.

scholarly journals The Dynamic Analysis of a Novel Reconfigurable Cubic Chaotic Map and Its Application in Finite Field

Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1420
Author(s):  
Chuanfu Wang ◽  
Yi Di ◽  
Jianyu Tang ◽  
Jing Shuai ◽  
Yuchen Zhang ◽  
...  
Keyword(s):  
Secure Communication ◽  
Chaotic Map ◽  
Digital Circuit ◽  
Pseudorandom Sequence ◽  
Periodic Behavior ◽  
Output Sequence ◽  
Digital Devices ◽  
Theoretical And Numerical Analysis ◽  
Dynamic Degradation ◽  
Sequence Generator

Dynamic degradation occurs when chaotic systems are implemented on digital devices, which seriously threatens the security of chaos-based pseudorandom sequence generators. The chaotic degradation shows complex periodic behavior, which is often ignored by designers and seldom analyzed in theory. Not knowing the exact period of the output sequence is the key problem that affects the application of chaos-based pseudorandom sequence generators. In this paper, two cubic chaotic maps are combined, which have symmetry and reconfigurable form in the digital circuit. The dynamic behavior of the cubic chaotic map and the corresponding digital cubic chaotic map are analyzed respectively, and the reasons for the complex period and weak randomness of output sequences are studied. On this basis, the digital cubic chaotic map is optimized, and the complex periodic behavior is improved. In addition, a reconfigurable pseudorandom sequence generator based on the digital cubic chaotic map is constructed from the point of saving consumption of logical resources. Through theoretical and numerical analysis, the pseudorandom sequence generator solves the complex period and weak randomness of the cubic chaotic map after digitization and makes the output sequence have better performance and less resource consumption, which lays the foundation for applying it to the field of secure communication.

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 Research on Pseudorandom Number Generator Based on Several New Types of Piecewise Chaotic Maps

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Hongyan Zang ◽  
Yue Yuan ◽  
Xinyuan Wei
Keyword(s):  
Theoretical Basis ◽  
Chaotic Maps ◽  
Dynamic Properties ◽  
Chaotic Map ◽  
Pseudorandom Number ◽  
Pseudorandom Number Generator ◽  
Number Generator ◽  
High Quality ◽  
One Dimensional ◽  
Construction Methods

This paper proposes three types of one-dimensional piecewise chaotic maps and two types of symmetrical piecewise chaotic maps and presents five theorems. Furthermore, some examples that satisfy the theorems are constructed, and an analysis and model of the dynamic properties are discussed. The construction methods proposed in this paper have a certain generality and provide a theoretical basis for constructing a new discrete chaotic system. In addition, this paper designs a pseudorandom number generator based on piecewise chaotic map and studies its application in cryptography. Performance evaluation shows that the generator can generate high quality random sequences efficiently.

A Chaotification model based on sine and cosecant functions for enhancing chaos

2021 ◽  
Author(s):  
Yuqing Li ◽  
Xing He ◽  
Dawen Xia
Keyword(s):  
Fixed Point ◽  
Lyapunov Exponent ◽  
Chaotic Maps ◽  
Dynamic Properties ◽  
Chaotic Map ◽  
Sample Entropy ◽  
One Dimensional ◽  
Model Based ◽  
Chaotic Region ◽  
Definition Of

Chaotic maps with higher chaotic complexity are urgently needed in many application scenarios. This paper proposes a chaotification model based on sine and cosecant functions (CMSC) to improve the dynamic properties of existing chaotic maps. CMSC can generate a new map with higher chaotic complexity by using the existing one-dimensional (1D) chaotic map as a seed map. To discuss the performance of CMSC, the chaos properties of CMSC are analyzed based on the mathematical definition of the Lyapunov exponent (LE). Then, three new maps are generated by applying three classical 1D chaotic maps to CMSC respectively, and the dynamic behaviors of the new maps are analyzed in terms of fixed point, bifurcation diagram, sample entropy (SE), etc. The results of the analysis demonstrate that the new maps have a larger chaotic region and excellent chaotic characteristics.

Image Encryption Based on Development of Hénon Chaotic Maps using Fractional Fourier Transform

2014 ◽  
Vol 5 (3) ◽  
pp. 62-77 ◽  
Author(s):  
Mona F. M. Mursi ◽  
Hossam Eldin H. Ahmed ◽  
Fathi E. Abd El-Samie ◽  
Ayman H. Abd El-Aziem
Keyword(s):  
Fourier Transform ◽  
Image Encryption ◽  
Chaotic Maps ◽  
Fractional Fourier Transform ◽  
Chaotic Map ◽  
Security Analysis ◽  
Experimental Tests ◽  
It Use ◽  
Arnold Cat Map ◽  
And Diffusion

In this paper, the authors propose an image encryption scheme based on the development of a Hénon chaotic map using fractional Fourier transform (FRFT) which is introduced to satisfy the necessity of high secure image. This proposed algorithm combines the main advantages of confusion and diffusion with (FRFT), it use Arnold Cat map for confusion and Hénon chaotic map or one of the proposed Hénon chaotic maps for diffusion. The proposed algorithm is compared with some image encryption algorithms based on Arnold Cat map, Baker chaotic map, Hénon chaotic map and RC6. The authors perform a comparison between them in several experimental tests as statistical analyses, processing time and security analysis. The authors find from these comparison tests that the proposed algorithm demonstrates good result even better than RC6 and other chaotic maps in some cases.

Sign in / Sign up

Export Citation Format

Share Document