Selective image encryption using a spatiotemporal chaotic system

A universal selective image encryption algorithm, in which the spatiotemporal chaotic system is utilized, is proposed to encrypt gray-level images. In order to resolve the tradeoff between security and performance, the effectiveness of selective encryption is discussed based on simulation results. The scheme is then extended to encrypt RGB color images. Security analyses for both scenarios show that the proposed schemes achieve high security and efficiency.     

A new cryptosystem based on chaotic map and operations algebraic

Based on the study of some existing chaotic encryption algorithms, a new block cipher is proposed. The proposed cipher encrypts 128-bit plaintext to 128-bit ciphertext blocks, using a 128-bit key K and the initial value x₀ and the control parameter mu of logistic map. It consists of an initial permutation and eight computationally identical rounds followed by an output transformation. Round r uses a 128-bit roundkey K^(r) to transform a 128-bit input C^(r-1), which is fed to the next round. The output after round 8 enters the output transformation to produce the final ciphertext. All roundkeys are derived from K and a 128-bit random binary sequence generated from a chaotic map. Analysis shows that the proposed block cipher does not suffer from the flaws of pure chaotic cryptosystems and possesses high security.     

Period distribution analysis of some linear maps

This paper discusses period properties of some linear maps which are employed in various applications such as image encryption, public key cryptography and watermarking. Conditions for the bijectiveness of such maps and the existence of a period are presented. Period structure is also given. Then, the recurrence equation theory is adopted to address the period distribution problem. Finally, a framework to solve the problem is proposed with a demonstration of its effectiveness and efficiency into some applications.     

A new chaotic cryptosystem

Based on the study of some previously proposed chaotic encryption algorithms, we found that it is dangerous to mix chaotic state or iteration number of the chaotic system with ciphertext. In this paper, a new chaotic cryptosystem is proposed. Instead of simply mixing the chaotic signal of the proposed chaotic cryptosystem with the ciphertext, a noise-like variable is utilized to govern the encryption and decryption processes. This adds statistical sense to the new cryptosystem. Numerical simulations show that the new cryptosystem is practical whenever efficiency, ciphertext length or security is concerned.     

A true random number generator based on mouse movement and chaotic cryptography

True random number generators are in general more secure than pseudo random number generators. In this paper, we propose a novel true random number generator which generates a 256-bit random number by computer mouse movement. It is cheap, convenient and universal for personal computers. To eliminate the effect of similar movement patterns generated by the same user, three chaos-based approaches, namely, discretized 2D chaotic map permutation, spatiotemporal chaos and “MASK” algorithm, are adopted to post-process the captured mouse movements. Random bits generated by three users are tested using NIST statistical tests. Both the spatiotemporal chaos approach and the “MASK” algorithm pass the tests successfully. However, the latter has a better performance in terms of efficiency and effectiveness and so is more practical for common personal computer applications.     

Global exponential stability for a class of retarded functional differential equations with applications in neural networks

In this paper, the global exponential stability and asymptotic stability of retarded functional differential equations with multiple time-varying delays are studied by employing several Lyapunov functionals. A number of sufficient conditions for these types of stability are presented. Our results show that these conditions are milder and more general than previously known criteria, and can be applied to neural networks with a broad range of activation functions assuming neither differentiability nor strict monotonicity. Furthermore, the results obtained for neural networks with time-varying delays do not assume symmetry of the connection matrix.     

Hopf Bifurcation on a Two-Neuron System with Distributed Delays: A Frequency Domain Approach

In this paper, a more general two-neuron model with distributed delays and weak kernel is investigated. By applying the frequency domain approach and analyzing the associated characteristic equation, the existence of bifurcation parameter point is determined. Furthermore, we found that if the mean delay is used as a bifurcation parameter, Hopf bifurcation occurs for the weak kernel. This means that a family of periodic solutions bifurcates from the equilibrium when the bifurcation parameter exceeds a critical value. The direction and stability of the bifurcating periodic solutions are determine by the Nyquist criterion and the graphical Hopf bifurcation theorem. Some numerical simulations for justifying the theoretical analysis are also given.     

An image encryption scheme using reverse 2-dimensional chaotic map and dependent diffusion

In recent years, a variety of chaos-based image cryptosystems have been studied. Most of them adopt the traditional confusion–diffusion architecture, which is considered insecure upon chosen/known plain-image attacks. In this paper, a nonlinear traverse on the plain-image using dependent diffusion and reverse cat map is proposed to replace the traditional linear traverse performed in the confusion phase. Two cryptosystems are designed and are implemented by software means. Simulation results and numerical analysis justify their high efficiency and sufficient strength.     

Hopf Bifurcation and Stability of Periodic Solutions for van der Pol Equation with Distributed Delay

The van der Pol equation with a distributed time delay is analyzed. Itslinear stability is investigated by employing the Routh–Hurwitzcriteria. Moreover, the local asymptotic stability conditions are alsoderived. By using the mean time delay as a bifurcation parameter, themodel is found to undergo a sequence of Hopf bifurcations. The directionand the stability criteria of the bifurcating periodic solutions areobtained by the normal form theory and the center manifold theorem. Somenumerical simulation examples for justifying the theoretical analysisare also given.