Transmitting a signal by amplitude modulation in a chaotic network

We discuss the ability of a network with non linear relays and chaotic dynamics to transmit signals, on the basis of a linear response theory developed by Ruelle \cite{Ruelle} for dissipative systems. We show in particular how the dynamics interfere with the graph topology to produce an effective transmission network, whose topology depends on the signal, and cannot be directly read on the ``wired'' network. This leads one to reconsider notions such as ``hubs''. Then, we show examples where, with a suitable choice of the carrier frequency (resonance), one can transmit a signal from a node to another one by amplitude modulation, \textit{in spite of chaos}. Also, we give an example where a signal, transmitted to any node via different paths, can only be recovered by a couple of \textit{specific} nodes. This opens the possibility for encoding data in a way such that the recovery of the signal requires the knowledge of the carrier frequency \textit{and} can be performed only at some specific node.Comment: 19 pages, 13 figures, submitted (03-03-2005

Implementation of a secure digital chaotic communication scheme on a DSP board

In this paper, a new a secure communication scheme using chaotic signal for transmitting binary digital signals is proposed and which is then implemented on a Digital Signal Processor (DSP) board. The method uses the idea of indirect coupled synchronization for generating the same keystream in the transmitter and receiver side. This chaotic keystream is applied to encrypt the message signal before being modulated with a chaotic carrier generated from the transmitter. Discrete chaotic maps, 3D Henon map and Lorenz system are used as transmitter/receiver and key generators respectively. The overall system is experimentally implemented in the TMS320C6713 DSK board using code composer and Simulink showing the successful message extraction thus proving the feasibility of the system in the DSP board

Experimental realization of a highly secure chaos communication under strong channel noise

A one-way coupled spatiotemporally chaotic map lattice is used to contruct cryptosystem. With the combinatorial applications of both chaotic computations and conventional algebraic operations, our system has optimal cryptographic properties much better than the separative applications of known chaotic and conventional methods. We have realized experiments to pratice duplex voice secure communications in realistic Wired Public Switched Telephone Network by applying our chaotic system and the system of Advanced Encryption Standard (AES), respectively, for cryptography. Our system can work stably against strong channel noise when AES fails to work.Comment: 15 pages, 5 figure

Isochronal synchrony and bidirectional communication with delay-coupled nonlinear oscillators

We propose a basic mechanism for isochronal synchrony and communication with mutually delay-coupled chaotic systems. We show that two Ikeda ring oscillators (IROs), mutually coupled with a propagation delay, synchronize isochronally when both are symmetrically driven by a third Ikeda oscillator. This synchronous operation, unstable in the two delay-coupled oscillators alone, facilitates simultaneous, bidirectional communication of messages with chaotic carrier waveforms. This approach to combine both bidirectional and unidirectional coupling represents an application of generalized synchronization using a mediating drive signal for a spatially distributed and internally synchronized multi-component system

Chaos-based communication scheme using proportional and proportional-integral observers

In this paper, we propose a new chaos-based communication scheme using the observers. The novelty lies in the masking procedure that is employed to hide the confidential information using the chaotic oscillator. We use a combination of the addition and inclusion methods to mask the information. The performance of two observers, the proportional observer (P-observer) and the proportional integral observer (PI-observer) is compared that are employed as receivers for the proposed communication scheme. We show that the P-observer is not suitable scheme since it imposes unpractical constraints on the messages to be transmitted. On the other hand, we show that the PI-observer is the better solution because it allows greater flexibility in choosing the gains of the observer and does not impose any unpractical restrictions on the message