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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
