Chaos for Stream Cipher

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.
8 pages 6 figures

Keywords

Cryptography and Security, A0

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30542

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0102012
 http://arxiv.org/abs/cs/0102012
 In proceedings of ADCOM 2000, Tata McGraw Hill 2001

Collections

arXiv