Chaos for Stream Cipher
Ninan Sajeeth Philip, K. Babu Joseph
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.
Create a lesson
Related papers
Decision-Focused Learning for Cyber-Physical Risk-Aware Power Grid Operations
Ayesha Siddiqua Dina, Ebisa D. Wollega, Afzal Hossain Sohag
ToFu: Exploiting and Fuzzing the LLM-Orchestrator-Tool Trust Boundary
Md Nazmul Islam Ananto, Pierre Prevost-Avenel, Colin Smith et al.
APEX-Harm: Evaluating Agent Safety in Shared Professional Workspaces
Ziyi Yang, Adel Bibi, Guohao Li et al.
A Systematic Study of Security Enforcement at Android Inter-Component Boundaries
Sandiyo Christan A
EviRepair: Evidence-Driven Agents for Reliable Vulnerability Repair
Yilian Shi, Qingyu Liu, Tianyi Zhou et al.
Towards Safe World Models: Risks, Defenses, and Evaluation
Xiaoma Wang, Litian Zhang, Xinze Shi et al.