arXiv subjects

Guanrong Chen

Publications and source records attributed to Guanrong Chen.

176 records · Page 10Linked to original sources

arXiv2005

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 Á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.

nlin.CD↗

arXiv2005

Breaking a chaos-noise-based secure communication scheme

This paper studies the security of a secure communication scheme based on two discrete-time intermittently-chaotic systems synchronized via a common random driving signal. Some security defects of the scheme are revealed: 1) the key space can be remarkably reduced; 2) the decryption is insensitive to the mismatch of the secret key; 3) the key-generation process is insecure against known/chosen-plaintext attacks. The first two defects mean that the scheme is not secure enough against brute-force attacks, and the third one means that an attacker can easily break the cryptosystem by approximately estimating the secret key once he has a chance to access a fragment of the generated keystream. Yet it remains to be clarified if intermittent chaos could be used for designing secure chaotic cryptosystems.

nlin.CD↗

arXiv2004

On the Security of the Yi-Tan-Siew Chaos-Based Cipher

This paper presents a comprehensive analysis on the security of the Yi-Tan-Siew chaotic cipher proposed in [IEEE TCAS-I 49(12):1826-1829 (2002)]. A differential chosen-plaintext attack and a differential chosen-ciphertext attack are suggested to break the sub-key K, under the assumption that the time stamp can be altered by the attacker, which is reasonable in such attacks. Also, some security Problems about the sub-keys $α$ and $β$ are clarified, from both theoretical and experimental points of view. Further analysis shows that the security of this cipher is independent of the use of the chaotic tent map, once the sub-key $K$ is removed via the proposed suggested differential chosen-plaintext attack.

cs.CR↗

arXiv2004

A Time-Varying Complex Dynamical Network Model And Its Controlled Synchronization Criteria

Today, complex networks have attracted increasing attention from various fields of science and engineering. It has been demonstrated that many complex networks display various synchronization phenomena. In this paper, we introduce a time-varying complex dynamical network model. We then further investigate its synchronization phenomenon and prove several network synchronization theorems. Especially, we show that synchronization of such a time-varying dynamical network is completely determined by the inner-coupling matrix, and the eigenvalues and the corresponding eigenvectors of the coupling configuration matrix of the network.

nlin.AO↗

arXiv2004

Hopf Bifurcation and Chaos in a Single Inertial Neuron Model with Time Delay

A delayed differential equation modelling a single neuron with inertial term is considered in this paper. Hopf bifurcation is studied by using the normal form theory of retarded functional differential equations. When adopting a nonmonotonic activation function, chaotic behavior is observed. Phase plots, waveform plots, and power spectra are presented to confirm the chaoticity.

nlin.CD↗

arXiv2004

Hopf Bifurcation and Chaos in Tabu Learning Neuron Models

In this paper, we consider the nonlinear dynamical behaviors of some tabu leaning neuron models. We first consider a tabu learning single neuron model. By choosing the memory decay rate as a bifurcation parameter, we prove that Hopf bifurcation occurs in the neuron. The stability of the bifurcating periodic solutions and the direction of the Hopf bifurcation are determined by applying the normal form theory. We give a numerical example to verify the theoretical analysis. Then, we demonstrate the chaotic behavior in such a neuron with sinusoidal external input, via computer simulations. Finally, we study the chaotic behaviors in tabu learning two-neuron models, with linear and quadratic proximity functions respectively.

nlin.CD↗

arXiv2004

Baptista-type chaotic cryptosystems: Problems and countermeasures

In 1998, M. S. Baptista proposed a chaotic cryptosystem, which has attracted much attention from the chaotic cryptography community: some of its modifications and also attacks have been reported in recent years. In [Phys. Lett. A 307 (2003) 22], we suggested a method to enhance the security of Baptista-type cryptosystem, which can successfully resist all proposed attacks. However, the enhanced Baptista-type cryptosystem has a nontrivial defect, which produces errors in the decrypted data with a generally small but nonzero probability, and the consequent error propagation exists. In this Letter, we analyze this defect and discuss how to rectify it. In addition, we point out some newly-found problems existing in all Baptista-type cryptosystems and consequently propose corresponding countermeasures.

cs.CR↗

arXiv2004

Stability of a neural network model with small-world connections

Small-world networks are highly clustered networks with small distances among the nodes. There are many biological neural networks that present this kind of connections. There are no special weightings in the connections of most existing small-world network models. However, this kind of simply-connected models cannot characterize biological neural networks, in which there are different weights in synaptic connections. In this paper, we present a neural network model with weighted small-world connections, and further investigate the stability of this model.

cond-mat.dis-nn↗

arXiv2004

Controlling the spreading in small-world networks

The spreading (propagation) of diseases, viruses, and disasters such as power blackout through a huge-scale and complex network is one of the most concerned issues today. In this paper, we study the control of such spreading in a nonlinear spreading model of small-world networks. We found that the short-cut adding probability $p$ in the N-W model \cite{N-W:1999} of small-world networks determines the Hopf bifurcation and other bifurcating behaviors in the proposed model. We further show a control technique that stabilize a periodic spreading behavior onto a stable equilibrium over the proposed model of small-world networks.

cond-mat.dis-nn↗

arXiv2004

On the topology of the world exchange arrangements web

Exchange arrangements among different countries over the world are foundations of the world economy, which generally stand behind the daily economic evolution. As the first study of the world exchange arrangements web (WEAW), we built a bipartite network with countries as one type of nodes and currencies as the other, and found it to have a prominent scale-free feature with a power-law degree distribution. In a further empirical study of the currency section of the WEAW, we calculated the clustering coefficients, average nearest-neighbors degree, and average shortest distance. As an essential economic network, the WEAW is found to be a correlated disassortative network with a hierarchical structure, possessing a more prominent scale-free feature than the world trade web (WTW).

physics.soc-ph↗

arXiv2004

Inherent Frequency and Spatial Decomposition of the Lorenz Chaotic Attractor

This letter suggests a new way to investigate 3-D chaos in spatial and frequency domains simultaneously. After spatially decomposing the Lorenz attractor into two separate scrolls with peaked spectra and a 1-D discrete-time zero-crossing series with a wide-band spectrum, it is found that the Lorenz chaotic attractor has an inherent frequency uniquely determined by the three system parameters. This result implies that chaos in the Lorenz attractor is mainly exhibited when the trajectory crosses from one scroll to another, not within the two scrolls. This is also true for some other double-scroll Lorenz-like chaotic attractors, such as Chua's attractor. Some possible applications of the inherent frequency and the spatial decomposition are also discussed.

nlin.CD↗

arXiv2004

A comprehensive weighted evolving network model

Many social, technological, biological, and economical systems are best described by weighted networks, whose properties and dynamics depend not only on their structures but also on the connection weights among their nodes. However, most existing research work on complex network models are concentrated on network structures, with connection weights among their nodes being either 1 or 0. In this paper, we propose a new weighted evolving network model. Numerical simulations indicate that this network model yields three power-law distributions of the node degrees, connection weights and node strengths. Particularly, some other properties of the distributions, such as the droop-head and heavy-tail effects, can also be reflected by this model.

cond-mat.dis-nn↗

arXiv2003

Network connection strengths: Another power-law?

It has been discovered recently that many social, biological and ecological systems have the so-called small-world and scale-free features, which has provoked new research interest in the studies of various complex networks. Yet, most network models studied thus far are binary, with the linking strengths being either 0 or 1, while which are best described by weighted-linking networks, in which the vertices interact with each other with varying strengths. Here we found that the distribution of connection strengths of scientific collaboration networks decays also in a power-law form and we conjecture that all weighted-linking networks of this type follow the same distribution.

cond-mat.dis-nn↗

arXiv2001

Synchronization in Scale-free Dynamical Networks: Robustness and Fragility

Recently, it has been demonstrated that many large complex networks display a scale-free feature, that is, their connectivity distributions have the power-law form. In this paper, we investigate the synchronization phenomena in a scale-free dynamical network. We show that its synchronizability is robust against random removal of nodes, but is fragile to specific removal of the most highly connected nodes.

cond-mat↗