Breaking chaotic switching using generalized synchronization: examples

Author

Yang, Tao ; Yang, Lin-Bao ; Yang, Chun-Mei

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA

Volume

45

Issue

10

fYear

1998

fDate

10/1/1998 12:00:00 AM

Firstpage

1062

Lastpage

1067

Abstract

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

Keywords

chaos; switching theory; synchronisation; telecommunication security; telecommunication switching; binary information signal; chaotic switching; generalized synchronization; hyperchaotic system; secure communication; simulation; transmitter; Chaos; Chaotic communication; Communication switching; Communication system security; Decoding; Information security; Laboratories; Robustness; Signal processing; Transmitters;

fLanguage

English

Journal_Title

Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on

Publisher

ieee

ISSN

1057-7122

Type

jour

DOI

10.1109/81.728860

Filename

728860