Secure multimedia communication presents new challenges that are difficult to handle by using the currently adopted encryption methods. Chaotic encryption is a new direction of cryptography. It uses chaotic system properties such as sensitivity to initial condition and loss of information. In order to reach higher performance, these methods take advantage of the more and more complex behavior o...

In this paper, we propose an adaptive encryption scheme for color images using Multiple Distinct Chaotic Maps (MDCM) and DNA computing. We have chosen three distinct chaotic maps, including a 2D-Henon map, Tent Logistic to separately encrypt the red, green, blue channels of original image. The proposed adaptively modifies parameters utilizing various statistical characteristics such as mean, va...

Abstract Coupled map lattices (CMLs) are prototypical dynamical systems on networks/graphs. They exhibit complex patterns generated via the interplay of diffusive/Laplacian coupling and nonlinear reactions modelled by a single iterated at each node; maps often taken as unimodal, e.g. , logistic or tent maps. In this letter, we propose class higher-order coupled involving hypergraph Laplacian, w...

In this paper an algorithm for multi-color image compression-encryption is introduced. For compression step fuzzy transform based on exponential b-spline function is used. In encryption step, a novel combination chaotic system based on Sine and Tent systems is proposed. Also in the encryption algorithm, 3D shift based on chaotic system is introduced. The simulation results and security analysis...

the threshold of weak and strong synchronization in a coupled chaotic gaussian map isdemonstrated by using the pyragas’ terminology. however, vieira and lichtenberg have shown that thepyragas’ criteria for weak and strong synchronization cannot be used for all chaotic systems. in this articlewe demonstrated some interesting synchronization behavior of two coupled chaotic systems with some zeroa...

We consider a family of piecewise linear bimodal maps having the outermost slopes positive and less than one. Three types of bifurcation structures incorporated into the parameter space of the map are described. These structures are formed by periodicity regions related to attracting cycles, namely, the skew tent map structure is associated with periodic points on two adjacent branches of the m...

We investigate the topological zeta function for unimodal maps in general and dynamical zeta functions for the tent map in particular. For the generic situation, when the kneading sequence is aperiodic, it is shown that the zeta functions have a natural boundary along its radius of convergence, beyond which the function lacks analytic continuation. We make a detailed study of the function ∏∞ n=...

It is well known that the time average or the center of mass for generic orbits of the standard tent map is 0.5. In this paper we show some interesting properties of the exceptional orbits, including periodic orbits, orbits without mass center, and orbits with mass centers different from 0.5. We prove that for any positive integer n, there exist n distinct periodic orbits for the standard tent ...

where β = β(β−1)−1, M ∈ N∪{∞}, and l0, l1, . . . is a uniquely determined (finite or infinite) sequence of non-negative integers (cf. [2]). Analogously to other types of expansions we may ask for bases β such that the set of numbers with periodic or even finite representation is as large as possible. In particular, we say that Tβ satisfies the periodicity property (P) if the orbit (T β (x))n≥1 ...

We introduce a new technique to study pattern avoidance in dynamical systems, namely the use of a commuter function between non-conjugate dynamical systems. We investigate the properties of such a commuter function, specifically h : [0, 1]→ [0, 1] satisfying T1 ◦ h = h ◦ Tμ, where Tμ denotes a symmetric tent map of height μ. We make use of this commuter function to prove strict inclusion of the...