Breaking chaotic switching using generalized synchronization: examples

In a chaotic switching scheme, a binary message signal is scrambled by two chaotic attractors. In this paper we present examples to show how generalized chaotic synchronization (GS) can be used to break chaotic switching schemes. Since GS is a very robust phenomenon, we find that an intruder can recover the binary information signal from chaotic switching schemes without knowing both the structure and parameters of the chaotic transmitter. The breaking method presented in this paper is not sensitive to the order of the transmitter, which means that even in a chaotic switching scheme which uses two hyperchaotic systems, the degree of security may still be low. The simulation results for both low order and high order transmitters are presented