Chaos for Stream Cipher
| dc.creator | Philip, Ninan Sajeeth | |
| dc.creator | Joseph, K. Babu | |
| dc.date | 2001-02-16 | |
| dc.date.accessioned | 2026-07-07T03:16:56Z | |
| dc.date.available | 2026-07-07T03:16:56Z | |
| dc.description | 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. | |
| dc.description | 8 pages 6 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0102012 | |
| dc.identifier | http://arxiv.org/abs/cs/0102012 | |
| dc.identifier | In proceedings of ADCOM 2000, Tata McGraw Hill 2001 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30542 | |
| dc.subject | Cryptography and Security | |
| dc.subject | A0 | |
| dc.title | Chaos for Stream Cipher | |
| dc.type | text |