Research on the Complexity of Binary Chaotic Sequences

Binary sequence of chaos has been widely applied in research and studies on secret communication. Binary chaotic pseudo-random sequence is obtained through assessing and quantifying chaotic sequence and the complexity of binary sequence is got hardly. In this paper, the chaotic sequence linear complexity is discussed, and a new criterion is proposed on binary sequence, based on the approximate entropy. Simulations indicate that the method is effective, and the corresponding theories are proved right.