Cryptographic Pseudo-Random Sequences from the Chaotic Henon Map
Abstract
A scheme for pseudo-random binary sequence generation based on the two-dimensional discrete-time Henon map is proposed. Properties of the proposed sequences pertaining to linear complexity, linear complexity profile, correlation and auto-correlation are investigated. All these properties of the sequences suggest a strong resemblance to random sequences. Results of statistical testing of the sequences are found encouraging. An attempt is made to estimate the keyspace size if the proposed scheme is used for cryptographic applications. The keyspace size is found to be large and is dependent on the precision of the computing platform used.
Cite
@article{arxiv.cs/0604018,
title = {Cryptographic Pseudo-Random Sequences from the Chaotic Henon Map},
author = {Madhekar Suneel},
journal= {arXiv preprint arXiv:cs/0604018},
year = {2007}
}
Comments
Submitted to the Indian Academy of Sciences for possible publication in Sadhana (Academy Proceedings in Engineering Sciences). Results of statistical tests included. Introduction revised