Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Crutchfield J P, Farmer J D, Packard N H, Shaw R S 1986 Chaos. Sci. Amer. 255: 38–49
Dachselt F, Schwarz W 2001 Chaos and cryptography. IEEE Trans. Circ. Sys. — I 48: 1498–1509
Falcioni M, Palatella L, Pigolotti S, Vulpiani A 2006 Properties making a chaotic system a good pseudo random number generator, ePrint arXiv:nlin.CD/0503035
FIPS PUB 140-1 1994 Federal information processing standards publication — Security requirements for cryptographic modules, U.S. Department of Commerce
FIPS PUB 140-2 2001 Federal information processing standards publication — Security requirements for cryptographic modules, U.S. Department of Commerce
Gleick J 1997 Chaos (London: Vintage)
Golomb SW 1964 Introduction to digital communication in SW Golomb (ed) Digital communications with space applications (Englewood Cliffs: Prentice Hall) 1–16
Golomb S W 1982 Shift register sequences (Laguna Hills: Aegean Park Press) 1–108
Hénon M 1976 A two-dimensional mapping with a strange attractor. Commun. Math. Phys. 50: 69–77
Kathleen T A, Sauer T D, Yorke J A 1997 Chaos—An introduction to dynamical systems (New York: Springer-Verlag) 43–91, 163–166, 238–239
Keeping E S 1962 Introduction to statistical inference (Princeton: D. Van Nostrand) 64–66
Kippenhahn R 1999 Code breaking: A history and exploration (Hyderabad: Universities Press) 201–204
Knuth D E 1998 The art of computer programming, Volume 2/Seminumerical algorithms, 3rd ed (Reading: Addison Wesley) 9–37
Kocarev L 2001 Chaos-based cryptography: A brief overview. IEEE Circ. and Sys. Mag. 1: 6–21
Kumar N 1996 Deterministic chaos: Complex chance out of simple necessity (Hyderabad: Universities Press)
Massey J L 1969 Shift register synthesis and BCH decoding. IEEE Trans. Inform. Theory 15: 122–127
Menezes A J, van Oorschot P C, Vanstone S A 1997 Handbook of applied cryptography (Boca Raton: CRC Press) 198–200
Mollin R A 2001 An introduction to cryptography (Boca Raton: Chapman and Hall/CRC) 115–116
Peitgen HO, Jürgens H, Saupe D 2004 Chaos and fractals, New frontiers of science 2nd ed (NewYork: Springer-Verlag) 609–627
Ramasubramanian S 1997 The normal distribution: From binomial to normal. Resonance 2: 15–24
Rukhin A, Soto J, Nechvatal J, Smid M, Barker E, Leigh S, Levenson M, Vangel M, Banks D, Heckert A, Dray J, Vo S 2001 NIST special publication 800-22:Astatistical test suite for random and pseudorandom number generators for cryptographic applications, National Institute of Standards and Technology
Shujun L, Xuanqin M, Yuanlong C 2001 Pseudorandom bit generator based on couple chaotic systems and its applications in stream cipher cryptography. Progress in Cryptology: INDOCRYPT-2001 The 2nd International Conference on Cryptology in India, Indian Institute of Technology, Madras, Chennai, India
Suneel M 2006 Electronic circuit realization of the logistic map. Sādhanā 31(1): 69–78
Woodcock C F, Smart N P 1998 p-adic chaos and random number generation. Experimental Math. 7: 333–342
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Suneel, M. Cryptographic pseudo-random sequences from the chaotic Hénon map. Sadhana 34, 689–701 (2009). https://doi.org/10.1007/s12046-009-0040-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12046-009-0040-y