Investigation on complexity analysis of chaos-based pseudorandom sequence

Abstract

In this paper, a method is presented to analyze chaos-based pseudorandom sequence and determine its complexity based on intensive statistical complexity measure. For the case of chaos-based sequence and octal chaos-based pseudorandom sequence produced by Logistic map and one-way coupled lattice, an example is made to demonstrate how it works. By improving permutation patterns, this method can be applied to binary chaos-based pseudorandom sequence. Simulations indicate that the method is effective to reflect the complexity of different chaos-based pseudorandom sequences produced by chaotic system, and it is superior to the entropy measure method.