【24h】

Adaptive chaotic maps and their application to pseudo-random numbers generation

机译:自适应混沌映射及其在伪随机数的应用

获取原文
获取原文并翻译 | 示例
           

摘要

Chaos-based stream ciphers form a prospective class of data encryption techniques. Usually, in chaos-based encryption schemes, the pseudo-random generators based on chaotic maps are used as a source of randomness. Despite the variety of proposed algorithms, nearly all of them possess many shortcomings. While sequences generated from single-parameter chaotic maps can be easily compromised using the phase space reconstruction method, the employment of multi-parametric maps requires a thorough analysis of the parameter space to establish the areas of chaotic behavior. This complicates the determination of the possible keys for the encryption scheme. Another problem is the degradation of chaotic dynamics in the implementation of the digital chaos generator with finite precision. To avoid the appearance of quasi-chaotic regimes, additional perturbations are usually introduced into the chaotic maps, making the generation scheme more complex and influencing the oscillations regime. In this study, we propose a novel technique utilizing the chaotic maps with adaptive symmetry to create chaos-based encryption schemes with larger parameter space. We compare pseudo-random generators based on the traditional Zaslaysky map and the new adaptive Zaslaysky web map through multi-parametric bifurcation analysis and investigate the parameter spaces of the maps. We explicitly show that pseudo-random sequences generated by the adaptive Zaslaysky map are random, have a weak correlation and possess a larger parameter space. We also present the technique of increasing the period of the chaotic sequence based on the variability of the symmetry coefficient. The speed analysis shows that the proposed encryption algorithm possesses a high encryption speed, being compatible with the best solutions in a field. The obtained results can improve the chaos-based cryptography and inspire further studies of chaotic maps as well as the synthesis of novel discrete models with desirable statistical properties. (C) 2020 Elsevier Ltd. All rights reserved.
机译:基于混乱的流密码,形成了一类潜在的数据加密技术。通常,在基于混沌的加密方案中,基于混沌映射的伪随机发生器用作随机性的源。尽管有各种所提出的算法,但几乎所有这些都具有许多缺点。虽然使用相位空间重建方法可以容易地损害从单参数混沌映射产生的序列,但是多参数映射的就业需要对参数空间进行全面分析以建立混沌行为的区域。这使得对加密方案的可能键的确定复杂化。另一个问题是具有有限精度的数字混沌发生器实现中混沌动力学的劣化。为避免准混沌制度的外观,通常将额外的扰动引入混沌图中,使得产生方案更复杂并影响振荡制度。在本研究中,我们提出了一种利用具有自适应对称的混沌映射的新技术,以创建基于混沌的加密方案,具有更大的参数空间。通过多参数分析分析,基于传统的Zaslaysky地图和新的自适应Zaslaysky Web地图进行比较伪随机发电机,并调查地图的参数空间。我们显着地表明,由自适应Zaslaysky地图产生的伪随机序列是随机的,相关性较弱并且具有更大的参数空间。我们还基于对称系数的可变性提高混沌序列时期的技术。速度分析表明,所提出的加密算法具有高加密速度,与字段中的最佳解决方案兼容。所获得的结果可以改善基于混沌的密码学并激发对混沌图的进一步研究以及具有所需统计特性的新型离散模型的合成。 (c)2020 elestvier有限公司保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号