Digital image watermarking using gyrator transform and chaotic maps

We propose a new method for digital image watermarking using gyrator transform and chaotic maps. Four chaotic maps have been used in the proposed technique. The four chaotic maps that have been used are the logistic map, the tent map, the Kaplan-Yorke map and the Ikeda map. These chaotic maps are used to generate the random phase masks and these random phase masks are known as chaotic random phase masks. A new technique has been proposed to generate the single chaotic random phase mask by using two chaotic maps together with different seed values. The watermark encoding method in the proposed technique is based on the double random phase encoding method. The gyrator transform and two chaotic random phase masks are used to encode the input image. The mean square error, the peak signal-to-noise ratio and the bit error rate have been calculated. Robustness of the proposed technique has been evaluated in terms of the chaotic maps, the number of the chaotic maps used to generate the CRPM, the rotation angle of the gyrator transform and the seed values of the chaotic random phase masks. Optical implementation of the technique has been proposed. The computer simulations are presented to verify the validity of the proposed technique.     

Chaos suppression through asymmetric coupling

We study pairs of identical coupled chaotic oscillators. In particular, we have used Roessler (in the funnel and no funnel regimes), Lorenz, and four-dimensional chaotic Lotka-Volterra models. In all four of these cases, a pair of identical oscillators is asymmetrically coupled. The main result of the numerical simulations is that in all cases, specific values of coupling strength and asymmetry exist that render the two oscillators periodic and synchronized. The values of the coupling strength for which this phenomenon occurs is well below the previously known value for complete synchronization. We have found that this behavior exists for all the chaotic oscillators that we have used in the analysis. We postulate that this behavior is presumably generic to all chaotic oscillators. In order to complete the study, we have tested the robustness of this phenomenon of chaos suppression versus the addition of some Gaussian noise. We found that chaos suppression is robust for the addition of finite noise level. Finally, we propose some extension to this research.     

基于数模混合的混沌映射实现

混沌随机序列发生器在数字实现时面临有限字长效应, 无法严格保证伪随机序列的非周期性. 构建了一类包含最少模拟器件的新数模混合系统, 分析比较了此类系统的非线性动力学行为. 利用现场可编程逻辑门阵列和RC电路实现了混沌映射, 构造了稳定的高速随机序列发生器, 可产生100 Gbit/s以上速率的随机数. 研究表明, 数模混合系统的混沌性对元件参数变化不敏感, 数模实现验证了新系统的存在性和物理上的可实现性. 系统易于集成在数字加密、保密通信和雷达波形产生等应用系统中.     

Communicating with noise: How chaos and noise combine to generate secure encryption keys

An approach for the secure transmission of encrypted messages using chaos and noise is presented in this paper. The method is based on the synchronization of certain types of chaotic oscillators in response to a common noise input. This allows two distant oscillators to generate identical output which can be used as a key for encryption and decryption of a message signal. The noiselike synchronizing input-which contains no message information-is communicated to identical oscillators in the transmitter and the receiver over a public channel. The encrypted message is also sent over a public channel, while the key is never transmitted at all. The chaotic nature of the oscillators which generate the key and the randomness of the signal driving the process combine to make the recovery of the key by an eavesdropper extremely difficult. We evaluate system performance with respect to security and robustness and show that a robust and secure system can be obtained. (c) 1998 American Institute of Physics.     

Chaos based multiple image encryption using multiple canonical transforms

We propose a new method for multiple image encryption using linear canonical transforms and chaotic maps. Three linear canonical transforms and three chaotic maps are used in the proposed technique. The three linear canonical transforms that have been used are the fractional Fourier transform, the extended fractional Fourier transform and the Fresnel transform. The three chaotic maps that have been used are the tent map, the Kaplan-Yorke map and the Ikeda map. These chaotic maps are used to generate the random phase masks and these random phase masks are known as chaotic random phase masks. The mean square error and the signal to noise ratio have been calculated. Robustness of the proposed technique to blind decryption has been evaluated. Optical implementation of the technique has been proposed. Experimental and simulations results are presented to verify the validity of the proposed technique.     

Encrypting the compressed image by chaotic map and arithmetic coding

Due to the efficient and secure requirements of image transmission, a number of research works have been done to encrypt the compressed image. Inspired by the arithmetic coding and chaotic map which are used to compress and encrypt image, respectively. In this paper, a scheme is proposed to encrypt the compressed image by chaotic map and arithmetic coding. This scheme compresses the image row by row which is firstly permuted by two logistic maps before arithmetic coding. It not only enhances the security of arithmetic coding, but also improves the compression ratio. To further improve the security of binary data which has been compressed, we use the chaotic maps to encrypt the data, and set different parameters and initial value for chaotic maps. In order to possess high sensitivities of key and plain-image, the keys that are employed to determine the parameter and initial value of chaotic maps are related to the plain-image. The experimental results validate the effect of the proposed scheme and demonstrate that the compressed and encrypted image is secure and convenient for transmission.     

Cooperative behaviors of coupled nonidentical oscillators with the same equilibrium points

The cooperative behaviors resulted from the interaction of coupled identical oscillators have been investigated intensively. However, the coupled oscillators in practice are nonidentical, and there exist mismatched parameters. It has been proved that under certain conditions, complete synchronization can take place in coupled nonidentical oscillators with the same equilibrium points, yet other cooperative behaviors are not addressed. In this paper, we further consider two coupled nonidentical oscillators with the same equilibrium points, where one oscillator is convergent while the other is chaotic,and explore their cooperative behaviors. We find that the coupling mode and the coupling strength can bring the coupled oscillators to different cooperation behaviors in unidirectional or undirected couplings. In the case of directed coupling,death islands appear in two-parameter spaces. The mechanism inducing these transitions is presented.     

Anti-synchronization of chaotic oscillators

We have observed anti-synchronization phenomena in coupled identical chaotic oscillators. Anti-synchronization can be characterized by the vanishing of the sum of relevant variables. We have qualitatively analyzed its base mechanism by using the dynamics of the difference and the sum of the relevant variables in coupled chaotic oscillators. Near the threshold of the synchronization and anti-synchronization transition, we have obtained the novel characteristic relation.     

Engineering generalized synchronization in chaotic oscillators

We report a method of engineering generalized synchronization (GS) in chaotic oscillators using an open-plus-closed-loop coupling strategy. The coupling is defined in terms of a transformation matrix that maps a chaotic driver onto a response oscillator where the elements of the matrix can be arbitrarily chosen, and thereby allows a precise control of the GS state. We elaborate the scheme with several examples of transformation matrices. The elements of the transformation matrix are chosen as constants, time varying function, state variables of the driver, and state variables of another chaotic oscillator. Numerical results of GS in mismatched Ro?ssler oscillators as well as nonidentical oscillators such as Ro?ssler and Chen oscillators are presented.     

Encryption and decryption of images with chaotic map lattices

We propose a secure algorithm for direct encryption and decryption of digital images with chaotic map lattices. The basic idea is to convert, pixel by pixel, the image color to chaotic logistic maps one-way coupled by initial conditions. After small numbers of iterations and cycles, the image becomes indistinguishable due to inherent properties of chaotic systems. Since the maps are coupled, the image can be completely recovered by the decryption algorithm if map parameters, number of iterations, number of cycles, and the image size are exactly known.     

Three types of synchronisation in complex modular networks

We study the synchronisation dynamics in complex modular networks. Through theoretical analysis, three types of synchronisation, i.e. uniform, modular and pattern synchronisation, are identified and necessary conditions for their stabilities are given. Numerical simulations with identical chaotic logistic maps and Lorenz oscillators are given to support the theoretical analysis.     

Anticipating the dynamics of chaotic maps

We study the regime of anticipated synchronization in unidirectionally coupled chaotic maps such that the slave map has its own output re-injected after a certain delay. For a class of simple maps, we give analytic conditions for the stability of the synchronized solution, and present results of numerical simulations of coupled 1D Bernoulli-like maps and 2D Baker maps, that agree well with the analytic predictions.     

混沌的乘法规律

从理论上分析了几个混沌映射相乘的规律，提出了混沌相乘的思想.数值仿真与理论计算结果表明，几个混沌映射相乘仍然具有非线性动力学特性和分岔序列.并且具有混沌吸引子和对初值敏感性.混沌的乘法概念具有重要的理论意义和应用价值. 关键词： 相乘混沌 吸引子 分岔序列     

Application Based Construction and Optimization of Substitution Boxes Over 2D Mixed Chaotic Maps

Chaotic maps play a vital role in the development of cryptographic techniques being used in today’s world. Efficient and highly secure algorithms can be constructed based on chaotic maps. Chaotic maps have the intrinsic property of being highly sensitive to initial conditions. In this paper, we have presented a novel scheme for construction and optimization of substitution boxes (S-boxes) based on mixed two dimensional (2D) chaotic maps in which cryptographic properties of S-boxes are optimized based on initial conditions of their parent 2D chaotic map. The proposed scheme and the resulting substitution boxes are analyzed with existing cryptanalysis techniques and their results have been compared with some other algorithms available in literature. The proposed scheme has been found to be more efficacious than other algorithms. The outcomes of security analysis indicate that our proposed technique and resulting optimized non-linear component in the current era of information technology.

     

Using chaos to produce synchronized stochastic dynamics in non-homogeneous map arrays with a random scalar coupling

Unidirectionally coupled chaotic systems hold great interest from the information processing and communications perspective. In this Letter, we report on a novel method for synchronizing two identical but internally non-homogeneous populations of chaotic maps using a scalar random coupling between them. The resulting synchronized dynamics is stochastic, and can be used in secure multi-user communication applications.     

Cryptanalyzing chaotic secure communications using return maps

In chaotic secure communications, message signals are scrambled by chaotic dynamical systems. The interaction between the message signals and the chaotic systems results in changes of different kinds of return maps. In this paper, we use return map based methods to unmask some chaotic secure communication systems; namely, chaotic shift keying (chaotic switching), chaotic parameter modulation and non-autonomous chaotic modulation. These methods are used without knowing the accurate knowledge of chaotic transmitters and without reconstructing the dynamics or identifying the parameters of chaotic transmitters. These methods also provide a criterion of deciding whether a chaotic secure communication scheme is secure or not. The effects of message signals on the changes of different return maps are studied. Fuzzy membership functions are used to characterize different kinds of changes of return maps. Fuzzy logic rules are used to extract message signals from the transmitted signal. The computer experimental results are provided. The results in this paper show that the security of chaotic secure communication not only depends on the complexity of the chaotic system but also depends on the way the message is scrambled. A more complex chaotic system is not necessary to provide a higher degree of security if the transmitted signal has simple and concentrated return maps. We also provide examples to show that a chaotic system with complicated return maps can achieve a higher degree of security to the attacks presented in this paper.     

Dispersion compensation in an open-loop all-optical chaotic communication system

The optical chaotic communication system using open-loop fiber transmission is studied under strong injection conditions. The optical chaotic communication system with open-loop configuration is studied using fiber transmission under strong injection conditions. The performances of fiber links composed of two types of fiber segments in different dispersion compensation maps are compared by testing the quality of the recovered message with different bit rates and encrypted by chaotic modulation (CM) or chaotic shift keying (CSK). The result indicates that the performance of the pre-compensation map is always worst. Two types of symmetrical maps are identical whatever the encryption method and bit-rate of message are. For the transmitting and the recovering of message of lower bit rate (1 Gb/s), the post-compensation map is the best scheme. However, for the message of higher bit rate (2.5 Gb/s), the parameters in communication system need to be modified properly in order to adapt to the high-speed application. Meanwhile, two types of symmetrical maps are the best scheme. In addition, the CM method is superior to the CSK method for high-speed applications. It is in accordance with the result in a back-to-back configuration system.     

基于扩展混沌映射的认证密钥协商协议

近年来,基于混沌映射和智能卡的认证密钥协商协议被相继提出.然而,防篡改读卡器使得这类协议的实现成本较高并且很难在实际中广泛应用.另外,基于混沌映射的数字签名方案需要很高的计算资源,这使得依赖签名方案的公钥发布存在安全问题.据此,本文基于扩展混沌映射提出一种新的无智能卡的认证密钥协商协议.新协议消除了公钥发布过程.安全和性能分析表明,新协议能抵抗各类攻击并且计算复杂度较低.因此,新协议更适合在实际环境中应用.     

Clustering zones in the turbulent phase of a system of globally coupled chaotic maps

The paper develops an approach to investigate the clustering phenomenon in the system of globally coupled chaotic maps first introduced by Kaneko in 1989. We obtain a relation between the transverse and longitudinal multipliers of the periodic clusters and prove the stability of these clusters for the case of symmetric, equally populated distributions between subclusters. Stable clusters emanate from the periodic windows of the logistic map and extend far into the turbulent phase. By numerical simulations we estimate a total basin volume of low-periodic clusters issued from the period-3 window and analyze the basin structure. The complement to the basin volume is ascribed to chaotic, very asymmetric high-dimensional clusters that are characterized by the presence of one or more leading clusters, accumulating about half of the oscillators while all the remaining oscillators do not cluster at all.