A scheme for pseudo-random binary sequence generation based on the two-dimensional discrete-time Hénon 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 estimate of the keyspace size is presented. © Indian Academy of Sciences.
CITATION STYLE
Suneel, M. (2009). Cryptographic pseudo-random sequences from the chaotic Hénon map. Sadhana - Academy Proceedings in Engineering Sciences, 34(5), 689–701. https://doi.org/10.1007/s12046-009-0040-y
Mendeley helps you to discover research relevant for your work.