论文标题
放大混乱，以获取快速，轻巧和可靠的密码系统
Zooming into chaos for a fast, light and reliable cryptosystem
论文作者
论文摘要
在先前的工作中，$ k $ logistic地图[Machica和Bruno，Chaos，vol。 27，053116（2017）]被引入，作为在$ k $中运行的转换，在logistic Map的重要数字较小。它利用了地图的伪随机性特征，该字符以其显着的数字较差。在这项工作中，我们全面分析了这种转换的动态和千古方面，显示了其适用于通用混乱图或集合的适用性，及其对实现快速，轻巧和可靠的加密系统的潜在影响。
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.
