2001/02/16 by Ninan Sajeeth Philip, K. Babu Joseph
Computer Science · #cs.CR
published as In proceedings of ADCOM 2000, Tata McGraw Hill 2001 · 8 pages 6 figures
arxiv created 2001/02/16 · arxiv updated 2009/11/30
This paper discusses mixing of chaotic systems as a dependable method for secure communication. Distribution of the entropy function for steady state as well as plaintext input sequences are analyzed. It is shown that the mixing of chaotic sequences results in a sequence that does not have any state dependence on the information encrypted by them. The generated output states of such a cipher approach the theoretical maximum for both complexity measures and cycle length. These features are then compared with some popular ciphers.