THEME SECTION: Complex Systems and Applications — PapersNo Access

EMERGENCE OF RANDOMNESS FROM CHAOS

R. LOZI

Laboratoire J.A. Dieudonné, UMR CNRS 7351, Université de Nice Sophia-Antipolis, Parc Valrose, 06108 NICE Cedex 02, France

I.U.F.M. Université de Nice Sophia-Antipolis, 89, Avenue George V, 06046 Nice Cedex 1, France

Search for more papers by this author

https://doi.org/10.1142/S0218127412500216Cited by:37 (Source: Crossref)

Abstract

In systems theory and science, emergence is the way complex systems and patterns arise out of a multiplicity of relatively simple interactions. Emergence is central to the theories of integrative levels and of complex systems [Aziz-Alaoui & Bertelle, 2009]. In this paper, we use the emergent property of the ultra weak multidimensional coupling of p 1-dimensional dynamical chaotic systems which leads from chaos to randomness.

Generation of random or pseudorandom numbers, nowadays, is a key feature of industrial mathematics. Pseudorandom or chaotic numbers are used in many areas of contemporary technology such as modern communication systems and engineering applications. More and more European or US patents using discrete mappings for this purpose are obtained by researchers of discrete dynamical systems [Petersen & Sorensen, 2007; Ruggiero et al., 2006]. Efficient Chaotic Pseudo Random Number Generators (CPRNG) have been recently introduced. They use the ultra weak multidimensional coupling of p 1-dimensional dynamical systems which preserve the chaotic properties of the continuous models in numerical experiments. Together with chaotic sampling and mixing processes, ultra weak coupling leads to families of (CPRNG) which are noteworthy [Hénaff et al., 2009a, 2009b, 2009c, 2010].

In this paper we improve again these families using a double threshold chaotic sampling instead of a single one.

We analyze numerically the properties of these new families and underline their very high qualities and usefulness as CPRNG when very long series are computed. Moreover, a determining property of such improved CPRNG is the high number of parameters used and the high sensitivity to the parameters value which allows choosing it as cipher-keys. It is why we call these families multiparameter chaotic pseudo-random number generators (M-p CPRNG).

Keywords:

References

M. A. Aziz-Alaoui and C. Bertelle , From System Complexity to Emergent Properties (Understanding Complex Systems) ( Springer-Verlag , Berlin , 2009 ) . Crossref, Google Scholar
G. E. P. Box and M. E. Muller, Ann. Math. Statist. 29, 610 (1958), DOI: 10.1214/aoms/1177706645. Crossref, Web of Science, Google Scholar
P. Goraet al., SIAM J. Appl. Dyn. Syst. 5, 84 (2006). Crossref, Web of Science, Google Scholar
S. Hénaff, I. Taralova and R. Lozi, Observers design for a new weakly coupled map function, Conf. Proc. ICCSA 2009, 3rd Int. Conf. Complex Systems and Applications, eds. C. Bertelle, X. Liu and M. A. Aziz-Alaoui (2009) pp. 47–50. Google Scholar
S. Hénaff, I. Taralova and R. Lozi, Indian J. Industr. Appl. Math. 2, 1 (2009). Google Scholar
S. Hénaff , I. Taralova and R. Lozi , Dynamical analysis of a new statistically highly performant deterministic function for chaotic signals generation , IPACS Open Access Electronic Library, Physics and Control 2009 ( 2009 ) . Google Scholar
S. Hénaff, I. Taralova and R. Lozi, J. Nonlin. Syst. Appl. 1, 87 (2010). Google Scholar
R. Knop, Commun. ACM 12, 28 (1969), DOI: 10.1145/362946.362996. Google Scholar
O. E. Lanford III, Experim. Math. 7, 317 (1998), DOI: 10.1080/10586458.1998.10504377. Crossref, Web of Science, Google Scholar
R. Lozi, Modern Mathematical Models, Methods and Algorithms for Real World Systems, eds. A. H. Siddiqi, I. S. Duff and O. Christensen (Anamaya Publishers, New Delhi, India, 2006) pp. 80–124. Google Scholar
R. Lozi, Indian J. Industr. Appl. Math. 1, 1 (2008). Web of Science, Google Scholar
R. Lozi, Chaotic sampling, very weakly coupling, and chaotic mixing: Three simple synergistic mechanisms to make new families of chaotic pseudo random number generators, 6th EUROMECH Non Linear Dynamics Conf. Saint-Petersburg, ENOC 2008 (IPACS open Access Electronic Library, Saint-Petersburg, 2008) pp. 1715–1724. Google Scholar
R. Lozi, Chaotic pseudo random number generators via ultra weak coupling of chaotic maps and double threshold sampling sequences, Conf. Proc. ICCSA 2009, 3rd Int. Conf. Complex Systems and Applications, eds. C. Bertelle, X. Liu and M. A. Aziz-Alaoui (2009) pp. 20–24. Google Scholar
Petersen, M. V. & Sorensen, H. M. [2007] "Method of generating pseudo-random numbers in an electronic device, and a method of encrypting and decrypting electronic data," United States Patent 7170997 . Google Scholar
Ruggiero, D., Mascolo, D., Pedaci, I. & Amato, P. [2006] "Method of generating successions of pseudo-random bits or numbers," United States Patent Application 20060251250 . Google Scholar
J. C. Sprott , Chaos and Time-Series Analysis ( Oxford University Press , Oxford, UK , 2003 ) . Crossref, Google Scholar
J. Viega, Practical random number generation in software, Proc. 19th Ann. Computer Security Applications Conf. (2003) pp. 129–140. Google Scholar
J. Viega and M. Messier , Secure Programming Cook Book for C and C++ ( O'Reilly , Sebastopol, CA , 2003 ) . Google Scholar