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

混乱的 加密 参数统计 算法 数学 随机性 密钥空间 计算机科学 理论计算机科学 统计物理学 人工智能 统计 操作系统 物理
作者
Александра Тутуева,Erivelton G. Nepomuceno,A. Karimov,В. С. Андреев,Денис Бутусов
出处
期刊:Chaos Solitons & Fractals [Elsevier]
卷期号:133: 109615-109615 被引量:121
标识
DOI:10.1016/j.chaos.2020.109615
摘要

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 Zaslavsky map and the new adaptive Zaslavsky 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 Zaslavsky 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.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
雨宫遥香完成签到 ,获得积分10
刚刚
你好完成签到,获得积分20
刚刚
wangfeng007完成签到 ,获得积分10
1秒前
成就薯片完成签到,获得积分10
1秒前
1秒前
ramu发布了新的文献求助10
2秒前
2秒前
九鹤完成签到 ,获得积分10
2秒前
2秒前
4秒前
xx完成签到,获得积分10
4秒前
4秒前
4秒前
4秒前
Stormi发布了新的文献求助10
4秒前
王灿灿发布了新的文献求助10
4秒前
玊尔完成签到,获得积分10
5秒前
干净的烧鹅完成签到,获得积分10
5秒前
9202211125完成签到,获得积分10
5秒前
詹姆斯哈登完成签到,获得积分10
5秒前
Seldomyg完成签到 ,获得积分10
6秒前
杜好好完成签到,获得积分10
6秒前
李hk完成签到,获得积分10
7秒前
炙热美女发布了新的文献求助10
8秒前
9秒前
9秒前
丘比特应助qrj采纳,获得10
9秒前
加油发布了新的文献求助10
9秒前
9秒前
李健的小迷弟应助李hk采纳,获得10
10秒前
carat完成签到,获得积分20
10秒前
sxiao18完成签到,获得积分10
10秒前
11秒前
11秒前
liansj完成签到,获得积分10
11秒前
一只哈士奇完成签到,获得积分10
11秒前
ZCX完成签到,获得积分10
12秒前
冬谎完成签到,获得积分10
12秒前
上官若男应助王娇娇采纳,获得10
12秒前
妮妮完成签到,获得积分10
13秒前
高分求助中
Evolution 10000
Sustainability in Tides Chemistry 2800
The Young builders of New china : the visit of the delegation of the WFDY to the Chinese People's Republic 1000
юрские динозавры восточного забайкалья 800
English Wealden Fossils 700
Foreign Policy of the French Second Empire: A Bibliography 500
Chen Hansheng: China’s Last Romantic Revolutionary 500
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 催化作用 物理化学 免疫学 量子力学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 3147162
求助须知:如何正确求助?哪些是违规求助? 2798435
关于积分的说明 7829030
捐赠科研通 2455138
什么是DOI,文献DOI怎么找? 1306576
科研通“疑难数据库(出版商)”最低求助积分说明 627838
版权声明 601567