DESIGN OF CHAOTIC PSEUDO-RANDOM BIT GENERATOR AND ITS APPLICATIONS IN STREAM-CIPHER CRYPTOGRAPHY

2008 ◽  
Vol 19 (05) ◽  
pp. 813-820 ◽  
Author(s):  
XING-YUAN WANG ◽  
XIAO-JUAN WANG
Keyword(s):  
Cycle Length ◽  
Chaotic Systems ◽  
Stream Cipher ◽  
Initial Conditions ◽  
Piecewise Linear ◽  
Chaotic Map ◽  
Control Parameters ◽  
One Dimensional ◽  
Piecewise Linear Chaotic Map ◽  
Encryption And Decryption

Because of the sensitivity of chaotic systems on initial conditions/control parameters, when chaotic systems are realized in a discrete space with finite states, the dynamical properties will be far different from the ones described by the continuous chaos theory, and some degradation will arise. This problem will cause the chaotic trajectory eventually periodic. In order to solve the problem, a new binary stream-cipher algorithm based on one-dimensional piecewise linear chaotic map is proposed in this paper. In the process of encryption and decryption, we employ a secret variant to perturb the chaotic trajectory and the control parameter to lengthen the cycle-length of chaotic trajectory. In addition, we design a nonlinear principle to generate a pseudo-random chaotic bit sequence as key stream. Cryptanalysis shows that the cryptosystem is of high security.

DESIGN OF PSEUDO-RANDOM BIT GENERATOR BASED ON CHAOTIC MAPS

2012 ◽  
Vol 26 (32) ◽  
pp. 1250208 ◽  
Author(s):  
XING-YUAN WANG ◽  
LEI YANG
Keyword(s):  
Cycle Length ◽  
Stream Cipher ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
The Other ◽  
One Dimensional ◽  
Random Bit Generator ◽  
Dynamical Properties ◽  
Finite States

In order to solve the problem of degradation of dynamical properties caused by finite states of computer, a new binary stream-cipher algorithm based on dual one-dimensional chaotic maps is proposed in this paper. In the process of generation, we employ a parameter of one chaotic map to perturb the other chaotic map's trajectory to lengthen the cycle-length of the other chaotic map's trajectory. In addition, we design a nonlinear principle to generate a pseudo-random chaotic bit sequence as key stream. Statistic proprieties show that the sequence is of high randomness.

scholarly journals A Novel Image Encryption Scheme Based on PWLCM and Standard Map

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-23
Author(s):  
Yucheng Chen ◽  
Chunming Tang ◽  
Zongxiang Yi
Keyword(s):  
Image Encryption ◽  
Initial Conditions ◽  
Piecewise Linear ◽  
Chaotic Map ◽  
Encryption Scheme ◽  
Standard Map ◽  
Diffusion Structure ◽  
Piecewise Linear Chaotic Map ◽  
Encryption Schemes ◽  
And Performance

In the past decades, considerable attention has been paid to the chaos-based image encryption schemes owing to their characteristics such as extreme sensitivity to initial conditions and parameters, pseudo-randomness, and unpredictability. However, some schemes have been proven to be insecure due to using a single chaotic system. To increase the security, this work proposes a novel image encryption scheme based on the piecewise linear chaotic map (PWLCM) and the standard map. To the best of our knowledge, it is the first chaos-based image encryption scheme combining the PWLCM with the standard map, which adopts permutation-diffusion structure. Unlike the traditional scrambling way, a hierarchical diffusion strategy, which not only changes the pixel position but also modifies the value, is employed in the permutation phase. The operation model of row-by-row and column-by-column is further used to enhance the efficiency in the diffusion process. Consequently, a good trade-off efficiency and security can be achieved. Furthermore, the numerical simulations and performance analyses illustrate that the proposed encryption scheme can be used in practical application scenarios requiring lightweight security.

Using Segment Number Parameter of Piecewise Linear Chaotic Map Construct Novel Hash Scheme

2011 ◽  
Vol 694 ◽  
pp. 479-484
Author(s):  
Peng Cheng Wei ◽  
Jun Jian Huang
Keyword(s):  
High Speed ◽  
Initial Conditions ◽  
Chaotic Dynamic ◽  
Piecewise Linear ◽  
Chaotic Map ◽  
Lookup Table ◽  
Piecewise Linear Chaotic Map ◽  
Computational Performance ◽  
Keyed Hash Function ◽  
Sensitivity To Initial Conditions

A novel keyed Hash function is presented based on the dynamic S-boxes. The proposed approach can give a chaotic Hash value by means of the lookup table of functions and chaotic dynamic S-box. Compared with the existing chaotic Hash functions, this method improves computational performance of Hash system by using the chaotic S-box substitution. Theoretical and experimental results show that the proposed method has not only strong one way property, sensitivity to initial conditions and chaotic system’s parameters, but also high speed.

A NEW CHAOTIC ENCRYPTION ALGORITHM BASED ON THE ERGODICITY OF CHAOS

2011 ◽  
Vol 25 (15) ◽  
pp. 2047-2053 ◽  
Author(s):  
XING-YUAN WANG ◽  
XIAO-JUAN WANG
Keyword(s):  
Chaotic Systems ◽  
Random Sequence ◽  
Chaotic Map ◽  
Encryption Algorithm ◽  
Chaotic Encryption ◽  
One Dimensional ◽  
Encryption And Decryption ◽  
Symmetric Key

This paper proposes a new symmetric key encryption algorithm based on one-dimensional chaotic map. This algorithm uses the random-like property and ergodicity of chaotic systems. In the process of encryption or decryption, this algorithm generates a chaotic pseudo-random sequence, changes the initial iterative times and the increment to encrypt the plaintext, and realizes fast encryption and decryption of all kinds of files. When analyzing the algorithm's performance and security, the result shows that, compared with the method of Baptista, the proposed method is safer, faster and more powerful.

A New Image Encryption Scheme Using Dual Chaotic Map Synchronization

2020 ◽  
Vol 18 (1) ◽  
Keyword(s):  
Image Encryption ◽  
Chaotic Systems ◽  
Initial Conditions ◽  
Chaotic Map ◽  
Security Applications ◽  
The Common ◽  
And Diffusion ◽  
Confusion And Diffusion ◽  
Sensitivity To Initial Conditions ◽  
Diffusion Properties

Chaotic systems behavior attracts many researchers in the field of image encryption. The major advantage of using chaos as the basis for developing a crypto-system is due to its sensitivity to initial conditions and parameter tunning as well as the random-like behavior which resembles the main ingredients of a good cipher namely the confusion and diffusion properties. In this article, we present a new scheme based on the synchronization of dual chaotic systems namely Lorenz and Chen chaotic systems and prove that those chaotic maps can be completely synchronized with other under suitable conditions and specific parameters that make a new addition to the chaotic based encryption systems. This addition provides a master-slave configuration that is utilized to construct the proposed dual synchronized chaos-based cipher scheme. The common security analyses are performed to validate the effectiveness of the proposed scheme. Based on all experiments and analyses, we can conclude that this scheme is secure, efficient, robust, reliable, and can be directly applied successfully for many practical security applications in insecure network channels such as the Internet

scholarly journals A Chaos based image Encryption Scheme using one Dimensional Exponential Logistic Map.

2019 ◽  
Vol 1 ◽  
pp. 223-237
Author(s):  
Terlumun Gbaden
Keyword(s):  
Correlation Coefficient ◽  
Chaotic Map ◽  
Logistic Map ◽  
Encryption Scheme ◽  
One Dimensional ◽  
Encryption And Decryption ◽  
Secret Keys ◽  
Encryption Decryption ◽  
Logistic Chaotic Map ◽  
Encrypted Images

The widespread use of images in various sectors of life makes its protection increasingly necessary and important. An improvement over encryption and decryption algorithm using exponential logistic chaotic map was proposed. In this work, we adopt an encryption/decryption strategy for colour images using the exponential logistic chaotic map. The proposed encryption/decryption algorithms are implemented in MATLAB for computer simulation. The experimental results indicate that the proposed algorithms can be used successfully to encrypt/decrypt images with secret keys. The performance analysis using histogram uniformity analysis and correlation coefficient show that the algorithms give larger space, quick speed and easy to realize. The encrypted images have good encryption effect and low correlation coefficient rendering it a good candidate for confidential and secure means of transmitting image information in untrusted networks.

GENERALIZED ARITHMETIC CODING USING DISCRETE CHAOTIC MAPS

2012 ◽  
Vol 22 (10) ◽  
pp. 1250256 ◽  
Author(s):  
QIUZHEN LIN ◽  
KWOK-WO WONG ◽  
JIANYONG CHEN
Keyword(s):  
Chaotic Maps ◽  
Piecewise Linear ◽  
Chaotic Map ◽  
Interval Mapping ◽  
International Standards ◽  
Arithmetic Coding ◽  
Initial Value ◽  
Compression Performance ◽  
Piecewise Linear Chaotic Map ◽  
Generalized Arithmetic

Making use of the Lebesgue measure preserving property of the piecewise linear chaotic map, a discrete piecewise linear chaotic map is employed to perform the generalized arithmetic coding, which is an optimal entropy coding algorithm adopted by international standards. After a number of message symbols have been encoded by the reverse interval mapping, an enlargement on the encoding interval is performed and some codeword bits are exported accordingly. Based on the enlarged encoding interval, the subsequent symbols are encoded with the modified chaotic maps, the lower and upper bounds of which are determined by the final encoding interval of the symbols already encoded. In the decoding process, the message symbols are recovered by iterating the corresponding chaotic map from an appropriate initial value. The encoding interval enlargement is tracked by performing reverse interval mapping on the decoded symbols. More codeword bits are shifted into the register to form the initial value for decoding the subsequent symbols. Simulation results verify that the compression performance of our scheme is very close to the entropy bound and is comparable to traditional finite-precision arithmetic coding. In addition, cryptographic capability can be integrated into our scheme to make it a joint compression and encryption scheme. Its security is enhanced when compared with the existing schemes based on traditional arithmetic coding.

Kendall’s Tau Based Correlation Analysis of Chaotic Sequences Generated by Piecewise Linear Maps

2015 ◽  
Vol 25 (13) ◽  
pp. 1550177
Author(s):  
Zouhair Ben Jemaa ◽  
Daniele Fournier-Prunaret ◽  
Safya Belghith
Keyword(s):  
Correlation Analysis ◽  
Chaotic Maps ◽  
Initial Conditions ◽  
Piecewise Linear ◽  
Chaotic Map ◽  
Linear Map ◽  
Piecewise Linear Map ◽  
Chaotic Sequences ◽  
Linear Maps ◽  
Piecewise Linear Maps

In many applications, sequences generated by chaotic maps have been considered as pseudo-random sequences. This paper deals with the correlation between chaotic sequences generated by a given piecewise linear map; we have based the measure of the correlation on the statistics of the Kendall tau, which is usually used in the field of statistics. We considered three piecewise linear maps to generate chaotic sequences and computed the statistics of the Kendall tau of couples of sequences obtained from randomly chosen couples of initial conditions. We essentially found that the results depend on the considered chaotic map and that it is possible to approach the uncorrelated case.

Sign in / Sign up

Export Citation Format

Share Document