Abstract
In this paper, a novel Pseudo Random Number Generator (PRNG) is introduced as an application of computing discrete time dynamical systems at finite resolution in chaos-based cryptography and chaotic optimization. It is based on constructing a combinatorial representation of a given chaotic map, expressing it as a graph, and walking randomly on the resulting graph. The limitations of current methods that use floating-point numbers in finite time compared to the proposed method that uses rational numbers at finite resolution are demonstrated.
M.A. Khamis and W. Gomaa—Contributing authors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Hilborn, R.C.: Chaos and Nonlinear Dynamics: An Introduction for Scientists and Engineers. Oxford University Press, New York (2000)
Phatak, S.C., Rao, S.S.: Logistic map: a possible random-number generator. Phys. Rev. E 51(4), 3670–3678 (1995). https://doi.org/10.1103/PhysRevE.51.3670
Amigó, J.M., Kocarev, L., Szczepanski, J.: Theory and practice of chaotic cryptography. Phys. Lett. A 366(3), 211–216 (2007). https://doi.org/10.1016/j.physleta.2007.02.021
Alioto, M., Bernardi, S., Fort, A., Rocchi, S., Vignoli, V.: On the suitability of digital maps for integrated pseudo-RNGs, pp. 349–352 (2003)
Alvarez, G., Li, S.: Some basic cryptographic requirements for chaos-based cryptosystems. Int. J. Bifurc. Chaos 16, 2129–2151 (2006)
Arroyo, D., Alvarez, G., Fernandez, V.: On the inadequacy of the logistic map for cryptographic applications. arXiv:0805.4355 [nlin] (2008)
Pellicer-Lostao, C., Lopez-Ruiz, R.: Notions of chaotic cryptography: Sketch of a chaos based cryptosystem. arXiv:1203.4134 [cs, nlin] (2012)
Persohn, K.J., Povinelli, R.J.: Analyzing logistic map pseudorandom number generators for periodicity induced by finite precision floating-point representation. Chaos Solitons Fract. 45(3), 238–245 (2012). https://doi.org/10.1016/j.chaos.2011.12.006
Tuncer, T., Celik, V.: Hybrid PRNG based on logistic map. In: 2013 21st Signal Processing and Communications Applications Conference (SIU), pp. 1–4 (2013). https://doi.org/10.1109/SIU.2013.6531517
Caponetto, R., Fortuna, L., Fazzino, S., Xibilia, M.G.: Chaotic sequences to improve the performance of evolutionary algorithms. IEEE Trans. Evol. Comput. 7(3), 289–304 (2003). https://doi.org/10.1109/TEVC.2003.810069
Yang, D., Li, G., Cheng, G.: On the efficiency of chaos optimization algorithms for global optimization. Chaos Solitons Fract. 34(4), 1366–1375 (2007). https://doi.org/10.1016/j.chaos.2006.04.057
Tatsumi, K., Ibuki, T., Tanino, T.: A chaotic particle swarm optimization exploiting a virtual quartic objective function based on the personal and global best solutions. Appl. Math. Comput. 219(17), 8991–9011 (2013). https://doi.org/10.1016/j.amc.2013.03.029
Zelinka, I., Chadli, M., Davendra, D., Senkerik, R., Pluhacek, M., Lampinen, J.: Hidden periodicity - chaos dependance on numerical precision. In: Zelinka, I., Chen, G., Rössler, O.E., Snasel, V., Abraham, A. (eds.) Nostradamus 2013: Prediction, Modeling and Analysis of Complex Systems. AISC, vol. 210, pp. 47–59. Springer, Hidelberg (2013). https://doi.org/10.1007/978-3-319-00542-3_7
Galias, Z.: Interval methods for rigorous investigations of periodic orbits. Int. J. Bifurc. Chaos 11(09), 2427–2450 (2001). https://doi.org/10.1142/S0218127401003516
Luzzatto, S., Pilarczyk, P.: Finite resolution dynamics. Found. Comput. Math. 11(2), 211–239 (2011). https://doi.org/10.1007/s10208-010-9083-z
ElShaarawy, I., Gomaa, W.: An efficient computational framework for studying dynamical systems. In: 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), Romania, pp. 138–145 (2013)
ElShaarawy, I., Gomaa, W.: Ideal quantification of chaos at finite resolution. In: Murgante, B., et al. (eds.) ICCSA 2014, Part I. LNCS, vol. 8579, pp. 162–175. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-09144-0_12
Lovász, L.: Random walks on graphs: A survey. Combinatorics Paul Erdõs Eighty 2, 1–46 (1993)
Acknowledgment
This work is mainly supported by the Ministry of Higher Education (MoHE) of Egypt through PhD fellowship awarded to Dr. Islam ElShaarawy. This work is supported in part by the Science and Technology Development Fund STDF (Egypt); Project id: 42519 - “Automatic Video Surveillance System for Crowd Scenes”, and by E-JUST Research Fellowship awarded to Dr. Mohamed A. Khamis.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
ElShaarawy, I., A. Khamis, M., Gomaa, W. (2022). Chaos-Based Applications of Computing Dynamical Systems at Finite Resolution. In: Hassanien, A.E., Rizk, R.Y., Snášel, V., Abdel-Kader, R.F. (eds) The 8th International Conference on Advanced Machine Learning and Technologies and Applications (AMLTA2022). AMLTA 2022. Lecture Notes on Data Engineering and Communications Technologies, vol 113. Springer, Cham. https://doi.org/10.1007/978-3-031-03918-8_57
Download citation
DOI: https://doi.org/10.1007/978-3-031-03918-8_57
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-03917-1
Online ISBN: 978-3-031-03918-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)