Generating random numbers are mainly used to create secret keys or random sequences. It can be carried out by various techniques. In this paper we present a very simple and efficient pseudo random number generator (PRNG) based on chaotic maps and S-Box tables. This technique adopted two main operations one to generate chaotic values using two logistic maps and the second to transform them into ...

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, th...

The discrete distribution of homoclinic orbits has been investigated numerically and experimentally in a CO2 laser with feedback. The narrow chaotic ranges appear consequently when a laser parameter (bias voltage or feedback gain) changes exponentially. Up to six consecutive chaotic windows have been observed in the numerical simulation as well as in the experiments. Every subsequent increase i...

The paper aim was an investigation on use of chaotic sequence in DS-CDMA. The DS-CDMA systems offer physical layer security without the need for a significant increase in computation or power requirements. Nowadays, DSCDMA has been used widely. These systems suffers from multiple access interference because of other users transmitting in the cell, channel inter symbol interference and additive ...

In this work, a new scheme of image encryption based on chaos and Fast Walsh Transform (FWT) has been proposed. We used two chaotic logistic maps and combined chaotic encryption methods to the two-dimensional FWT of images. The encryption process involves two steps: firstly, chaotic sequences generated by the chaotic logistic maps are used to permute and mask the intermediate results or array o...

The purpose of this letter is to define a distance on the underlying phase space of a chaotic map, based on natural invariant density of the map. It is observed that for logistic map this distance is equivalent to Wootters’ statistical distance. This distance becomes the Euclidean distance for a map with constant invariant density. ∗Postal Address: 1110, 36-C, Chandigarh -160014, India

We describe up to conjugacy all unimodal and bimodal maps that are chaotic, by giving necessary and sufficient conditions for unimodal and bimodal maps of slopes ±s to be transitive.

In the family of area-contracting Hénon-like maps with zero topological entropy we show that there are maps with infinitely many moduli of stability. Thus one cannot find all the possible topological types for non-chaotic area-contracting Hénon-like maps in a family with finitely many parameters. A similar result, but for the chaotic maps in the family, became part of the folklore a short time ...

Recent work on a symbolic approach to the calculation of probability distributions arising in the application of the Ott-Grebogi-Yorke strategy to transiently chaotic tent maps is extended to the case of control to a nontrivial periodic orbit. Closed forms are derived for the probability of control being achieved and the average number of iterations to control when it occurs. Both single-compon...