Date Added: Dec 2012
The relationship between cryptographic measures and chaotic dynamical complexity measures is studied in this paper, including linear complexity and measure entropy, nonlinear complexity and source entropy. Moreover, a method is presented to guarantee the complexity of chaos-based pseudorandom sequence due to this relationship. This is important to the development of chaos-based cryptography. Pseudorandom binary sequences are widely applied to the various engineering domains such as biology system control, spread spectrum communications and cryptography. Particularly, the security of cryptographic systems is strongly contingent on the pseudorandomness of the key stream.