Hierarchy of one and many-parameter families of random trigonometric chaotic maps and one-parameter random elliptic chaotic maps of cn type with an invariant measure have been introduced. Using the invariant measure (Sinai-Ruelle-Bowen measure), the Kolmogrov-Sinai entropy of the random chaotic maps have been calculated analytically, where the numerical simulations support the results .

This paper presents an efficient block-wise image encryption method based on multiple chaotic maps. The image is divided into four overlapping blocks and each block is permutated with Cat map and its parameters are controlled by Henon map using multiple keys. Due to overlapping division of blocks, it produces effect of double permutation in the middle portion of overlapped image in single permu...

Image encryption is one of the most common and important method of image data encryption. Image encryption deals with applying image encryption algorithms to the sending image and convert it into cipherimage, and only authorized person can decrypt the cipher-image to gent the original image, this done using secret key(s). There are big numbers of encryption techniques including chaos-based sche...

Fix a nontrivial interval X C R and let / e C1(X,X) be a chaotic mapping. We denote by Aoo (/) the set of points whose orbits do not converge to a (one-sided) asymptotically stable periodic orbit of / or to a subset of the absorbing boundary of X for /. A. We assume that / satisfies the following conditions: (1) the set of asymptotically stable periodic points for / is compact (an empty set is ...

Recently an image encryption scheme based on chaotic maps and memory cellular automata has been proposed. In this paper, the security of the scheme is evaluated and it is demonstrated that the scheme can be broken by chosen plain-text attack. Having one or more monochrome plain-images and their corresponding cipherimages, a part of key-stream can be retrieved. Furthermore, it is discovered that...

Pisarchik et al. presented an image encryption algorithm based on chaotically coupled chaotic maps. But G. Arroyo et al. found some flaws and security weaknesses in the proposed cryptosystem. In this letter, the speed of this chaotic cryptosystem is analyzed and the encryption speed claimed by the authors is argued. The maximum possible speed for the proposed algorithm is calculated analyticall...

Pseudo-Random Bit Generation (PRBG) is required in many aspects of cryptography as well as in other applications of modern security engineering. In this work, PRBG based on 2D symmetrical chaotic mappings of logistic type is considered. The sequences generated with a chaotic PRBG of this type, are statistically tested and the computational effectiveness of the generators is estimated. Consideri...

Synchronization of identical chaotic systems subjected to common noise has been the subject of recent research. Studies on several chaotic systems have shown that, the synchronization is actually induced by the non-zero mean of the noise, and symmetric noise with zero-mean cannot lead to synchronization. Here it is presented that synchronization can be achieved by zero-mean noise in some chaoti...

Designing chaotic maps with complex dynamics is a challenging topic. This paper introduces the nonlinear chaotic processing (NCP) model, which contains six basic nonlinear operations. Each operation is a general framework that can use existing chaotic maps as seed maps to generate a huge number of new chaotic maps. The proposed NCP model can be easily extended by introducing new nonlinear opera...

The problem discussed in this paper is the effect of latency time on the OGY chaos control methodology in multi chaotic systems. The Smith predictor, rhythmic and memory strategies are embedded in the OGY chaos control method to encounter loop latency. A comparison study is provided and the advantages of the Smith predictor approach are clearly evident from the closed loop responses. The comple...