Chaos Theory for Secure Communication

Title: Chaos Theory for Secure Communication

Abstract: This research explores the use of chaotic systems for secure communication. It examines the mixing of chaotic sequences and analyzes the entropy function for steady-state and plaintext input sequences. The study shows that chaotic sequences do not depend on the information encrypted by them, and the generated output states approach the theoretical maximum for both complexity measures and cycle length. These features are compared with popular ciphers, demonstrating the potential of chaos theory for secure communication.

Main Research Question: Can chaotic systems be used to create a dependable method for secure communication?

Methodology: The study uses the Logistic Equation, a simple nonlinear equation used to model various phenomena in nature. It examines the mixing of chaotic sequences and analyzes the entropy function for both steady-state and plaintext input sequences.

Results: The research shows 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 approach the theoretical maximum for both complexity measures and cycle length.

Implications: The findings suggest that chaos theory can be used to create a dependable method for secure communication. The study's comparison with popular ciphers highlights the potential advantages of using chaotic systems, such as maximum cycle length and resistance to known plaintext attacks. However, further research is needed to fully realize the potential of chaos theory in secure communication systems.

Link to Article: https://arxiv.org/abs/0102012v1 Authors: arXiv ID: 0102012v1