Zooming into chaos for a fast, light and reliable cryptosystem
This work addresses the need for efficient and secure encryption methods, though it appears incremental as it builds on prior analysis of the k-logistic map.
The authors tackled the problem of creating a fast, light, and reliable cryptosystem by comprehensively analyzing the dynamical and ergodic aspects of the k-logistic map, a transformation that exploits pseudo-randomness in chaotic maps, and demonstrated its applicability to generic chaotic systems.
In previous work, the $k$-logistic map [Machicao and Bruno, Chaos, vol. 27, 053116 (2017)] was introduced as a transformation operating in the $k$ less significant digits of the Logistic map. It exploited the map's pseudo-randomness character that is present in its less significant digits. In this work, we comprehensively analyze the dynamical and ergodic aspects of this transformation, show its applicability to generic chaotic maps or sets, and its potential impact on enabling the creation of a cryptosystem that is fast, light and reliable.