Chaotic secure communication in multiple access environment using iterated maps

This paper proposes a chaos based Frequency Hopped Spread Spectrum communication system. It is always desirable to use, large sets of frequency hopping sequences with large period, large linear span and good Hamming correlation in multiple access applications. Most of the FH systems are based on either PN sequences or Reed-Solomon codes, which are potentially weak, especially when there is intelligent jamming. In this context, a new class of sequences, based on chaotic systems, refered to as chaotic sequences, are used for frequency hopping. Frequency Hopping systems based on the iterated map, the so-called ‘Difference Map’ is proposed in this paper. Unlike the m-sequences, the number and length of such sequences are not restricted. Also, the noise-like appearance of such sequences can result in low probability of intercept.