Breaking a chaos-based secure communication scheme designed by an improved modulation method

Recently Bu and Wang [Chaos, Solitons & Fractals 19 (2004) 919] proposed a simple modulation method aiming to improve the security of chaos-based secure communications against return-map-based attacks. Soon this modulation method was independently cryptanalyzed by Chee et al. [Chaos, Solitons & Fractals 21 (2004) 1129], Wu et al. [Chaos, Solitons & Fractals 22 (2004) 367], and \'{A}lvarez et al. [Chaos, Solitons & Fractals, accepted (2004), arXiv:nlin.CD/0406065] via different attacks. As an enhancement to the Bu-Wang method, an improving scheme was suggested by Wu et al. by removing the relationship between the modulating function and the zero-points. The present paper points out that the improved scheme proposed by Wu et al. is still insecure against a new attack. Compared with the existing attacks, the proposed attack is more powerful and can also break the original Bu-Wang scheme. Furthermore, it is pointed out that the security of the modulation-based schemes is not so satisfactory from a pure cryptographical point of view. The synchronization performance of this class of modulation-based schemes is also discussed.Comment: elsart.cls, 18 pages, 9 figure

Synchronization in complex networks

Synchronization processes in populations of locally interacting elements are in the focus of intense research in physical, biological, chemical, technological and social systems. The many efforts devoted to understand synchronization phenomena in natural systems take now advantage of the recent theory of complex networks. In this review, we report the advances in the comprehension of synchronization phenomena when oscillating elements are constrained to interact in a complex network topology. We also overview the new emergent features coming out from the interplay between the structure and the function of the underlying pattern of connections. Extensive numerical work as well as analytical approaches to the problem are presented. Finally, we review several applications of synchronization in complex networks to different disciplines: biological systems and neuroscience, engineering and computer science, and economy and social sciences.Comment: Final version published in Physics Reports. More information available at http://synchronets.googlepages.com

Role of Alpha Oscillations During Short Time Memory Task Investigated by Graph Based Partitioning

In this study, we investigate the clustering pattern of alpha band (8 Hz - 12 Hz) electroencephalogram (EEG) oscillations obtained from healthy individuals during a short time memory task with 3 different memory loads. The retention period during which subjects were asked to memorize a pattern in a square matrix is analyzed with a graph theoretical approach. The functional coupling among EEG electrodes are quantified via mutual information in the time-frequency plane. A spectral clustering algorithm followed by bootstrapping is used to parcellate memory related circuits and for identifying significant clusters in the brain. The main outcome of the study is that the size of the significant clusters formed by alpha oscillations decreases as the memory load increases. This finding corroborates the active inhibition hypothesis about alpha oscillations

Synchronization in discrete-time networks with general pairwise coupling

We consider complete synchronization of identical maps coupled through a general interaction function and in a general network topology where the edges may be directed and may carry both positive and negative weights. We define mixed transverse exponents and derive sufficient conditions for local complete synchronization. The general non-diffusive coupling scheme can lead to new synchronous behavior, in networks of identical units, that cannot be produced by single units in isolation. In particular, we show that synchronous chaos can emerge in networks of simple units. Conversely, in networks of chaotic units simple synchronous dynamics can emerge; that is, chaos can be suppressed through synchrony

Stability analysis of coupled map lattices at locally unstable fixed points

Numerical simulations of coupled map lattices (CMLs) and other complex model systems show an enormous phenomenological variety that is difficult to classify and understand. It is therefore desirable to establish analytical tools for exploring fundamental features of CMLs, such as their stability properties. Since CMLs can be considered as graphs, we apply methods of spectral graph theory to analyze their stability at locally unstable fixed points for different updating rules, different coupling scenarios, and different types of neighborhoods. Numerical studies are found to be in excellent agreement with our theoretical results.Comment: 22 pages, 6 figures, accepted for publication in European Physical Journal