2000 character limit reached
Zooming into chaos for a fast, light and reliable cryptosystem (2001.03549v1)
Published 10 Jan 2020 in nlin.CD, cs.CR, cs.IT, and math.IT
Abstract: 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.