We investigate the origin of diffusion in non-chaotic systems. As an example, we consider 1D map models whose slope is everywhere 1 (therefore the Lyapunov exponent is zero) but with random quenched discontinuities and quasi-periodic forcing. The models are constructed as non-chaotic approximations of chaotic maps showing deterministic diffusion, and represent one-dimensional versions of a Lore...

We derive the Cramér-Rao lower bound associated with the estimation of the initial condition of noise-embedded chaotic signals produced by general onedimensional maps. We relate its asymptotic behaviour to the chaotic attractor’s Lyapunov number. These results can be used to choose the chaotic generator more suitable for applications on chaotic digital communication systems.

Chaos-based communications can be applied advantageously if the property of chaotic systems is suitably exploited. In this Letter a simple noncoherent detection method for chaos-shift-keying (CSK) modulation is proposed, exploiting some distinguishable property of chaotic maps for recovering the digital message. Specifically, the proposed method exploits the difference in the return maps of the...

Chaos-based communication can be applied advantageously only if the property of chaotic systems is suitably exploited. In this paper a simple non-coherent detection method for chaos-shiftkeying (CSK) modulation is proposed. Unlike the bit-energy-based detection which makes no specific use of any chaotic system property, the method proposed here exploits some distinguishable property of the two ...

By cross-coupling two logistic maps a novel method is proposed for the public key steganography in JPEG image. Chaotic maps entail high complexity in the used algorithm for embedding secret data in a medium. In this paper, discrete crosscoupled chaotic maps are used to specifying the location of the different parts of the secret data in the image. Modifying JPEG format during compressing and de...

The present paper focuses on the two time scale dynamics generated by 2D polynomial noninvertible maps T of (Z0−Z2) and (Z1−Z3−Z1) types. This symbolism, specific to noninvertible maps, means that the phase plane is partitioned into zones Zk, where each point possesses the k real rank-one preimages. Of special interest here is the structure of slow and fast motion sets of such maps. The formati...

Recently, Pareek et al. [Phys. Lett. A 309 (2003) 75] have developed a symmetric key block cipher algorithm using a one-dimensional chaotic map. In this paper, we propose a symmetric key block cipher algorithm in which multiple one-dimensional chaotic maps are used instead of a one-dimensional chaotic map. However, we also use an external secret key of variable length (maximum 128-bits) as used...

The present paper is aimed at introducing a new algorithm for image encryption using chaotic tent maps and the desired key image. This algorithm consists of two parts, the first of which works in the frequency domain and the second, in the time domain. In the frequency domain, a desired key image is used, and a random number is generated, using the chaotic tent map, in order to change the phase...