arXiv · cs/0102012
Chaos for Stream Cipher
Abstract
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.
Explore related subjects
Keep this discovery
Ninan Sajeeth Philip, K. Babu Joseph. 2001-02-16. Chaos for Stream Cipher. https://arxiv.org/abs/cs/0102012
Cite the original work for its findings. Save a collection to share your selection of sources.