Periodicity of Timeseries Generated by Logistic Map: Part II

Authors

DOI:

https://doi.org/10.31861/sisiot2024.2.02003

Keywords:

periodicity of chaos, chaotic timeseries, logistic map

Abstract

The paper investigates the impact of limited computational precision on chaotic systems used in cryptography, focusing on how floating-point arithmetic influences the periodicity and degradation of chaotic timeseries. The study analyses the behaviour of logistic map, revealing that different initial conditions and parameters lead to varying cycle lengths, which are critical for maintaining chaos in encryption algorithms. The order of arithmetic operations and the choice of coupling methods between maps are shown to significantly affect the system's dynamics. The efficiency of using floating-point and fixed-point arithmetic is compared, demonstrating that precision limitations can lead to the degradation of chaos, thereby compromising the effectiveness of some chaos-based ciphers. The research provides insights into the behaviour of chaotic systems under computational constraints, aiming to improve the reliability and security of chaotic encryption techniques.

Downloads

Download data is not yet available.

Author Biographies

  • Oleh Krulikovskyi, Yuriy Fedkovych Chernivtsi National University

    Assistant professor at Radio Engineering and Information Security Department of Chernivtsi National University. His research field covers digital signal processing, FPGA and hardware cryptography. Author of more than 20 publications.

  • Serhii Haliuk, Yuriy Fedkovych Chernivtsi National University

    Assistant professor at Radio Engineering and Information Security Department of Chernivtsi National University. His research interest covers the development of the different components of hidden communication systems, signal processing and software development. Author of more than 40 publications.

  • Viktor Ivashko, Yuriy Fedkovych Chernivtsi National University

    Assistant at the Computer Sciences Department of Chernivtsi National University. His research field covers computer modeling of stochastic processes in physical systems. Author of more than 18 publications.

  • Ruslan Politanskyi, Yuriy Fedkovych Chernivtsi National University

    Received a Ph.D. in solid state physics from Yuriy Fedkovych Chernivtsi National University. Received a Dr. of Eng. Science in Telecommunication from National University «Lviv Polytechnic». His research interests include signal processing, coding theory, pseudorandom sequence systems with chaotic dynamics, physical principles of processes for information coding, distribution and transferring.

References

F. Sun, Z. Lv, and C. Wang, "Pseudo-random number generation based on spatial chaotic map of Logistic type and its cryptographic application," International Journal of Modern Physics C, vol. 35, no. 1, pp. 1-17, Jan. 2024.

H. Zhao, S. Xie, and J. Zhang, "Fast image encryption based on new cascade chaotic system and Rubik's cube strategy," Multimedia Tools and Applications, vol. 83, no. 9, pp. 1-15, 2024.

Mihailescu, M.I., Nita, S.L. Chaos-based Cryptography. In: Pro Cryptography and Cryptanalysis with C++23. Apress, Berkeley, CA, 2023.

A. Semenov, O. Osadchuk, O. Semenova, O. Bisikalo, O. Vasilevskyi and O. Voznyak, "Signal Statistic and Informational Parameters of Deterministic Chaos Transistor Oscillators for Infocommunication Systems," 2018 International Scientific-Practical Conference Problems of Infocommunications. Science and Technology (PIC S&T), Kharkiv, Ukraine, 2018, pp. 730-734

Mykola Kushnir, Hryhorii Kosovan, і Petro Kroialo, “Investigation of properties of chaotic generators of pseudo-random sequences constructed using fuzzy logic”, ІККТ, vol. 1, p. 63-72, Jan. 2022.

O.V. Krulokovskyi, S.D. Haliuk, L.F. Politanskyi “Testing timeseries ring-coupled map generated by on FPGA”, Telecommunication and Informative Technologies – 2016. – №4(53). – С. 24-29.

S. Bhattacharjee, H. Sharma, T. Choudhury, and A. M. Abdelmoniem, “Leveraging chaos for enhancing encryption and compression in large cloud data transfers”, The Journal of Supercomputing, Feb. 2024.

Fei Yu, Lixiang Li, Qiang Tang, Shuo Cai, Yun Song, and Quan Xu, “A Survey on True Random Number Generators Based on Chaos”, Discrete Dynamics in Nature and Society, vol. 2019, A. ID 2545123, 2019.

O. Krulikovskyi and S. Haliuk, “Periodicity of Timeseries Generated by Logistic Map. Part I”, SISIOT, vol. 1, no. 2, p. 02010, Dec. 2023.

C. Fan, Q. Ding, “Effects of Limited Computational Precision on the Discrete Chaotic Sequences and the Design of Related Solutions”, Complexity, 2019, 3510985, 2019.

C. L. Fan and Q. Ding, “Analyzing the period distribution of digital chaos with graph theory,” Physica Scripta, vol. 96, no. 8, p. 085212, May 2021.

L.-C. Cao, Y.-L. Luo, S.-H. Qiu, and J.-X. Liu, “A perturbation method to the tent map based on Lyapunov exponent and its application,” Chinese Physics B, vol. 24, no. 10, p. 100501, Sep. 2015.

J. Zheng, H. Hu, and X. Xia, “Applications of symbolic dynamics in counteracting the dynamical degradation of digital chaos,” Nonlinear Dynamics, vol. 94, no. 2, pp. 1535–1546, Jul. 2018.

D. Goldberg, “What every computer scientist should know about floating-point arithmetic,” ACM Computing Surveys, vol. 23, no. 1, pp. 5–48, Mar. 1991.

Downloads


Abstract views: 46

Published

2024-12-30

Issue

Vol. 2 No. 2 (2024)

Section

Articles

License

Copyright (c) 2024 Security of Infocommunication Systems and Internet of Things

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
O. Krulikovskyi, S. Haliuk, V. Ivashko, and R. Politanskyi, “Periodicity of Timeseries Generated by Logistic Map: Part II”, SISIOT, vol. 2, no. 2, p. 02003, Dec. 2024, doi: 10.31861/sisiot2024.2.02003.

Similar Articles

You may also start an advanced similarity search for this article.