检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:丁元明[1,2] 朱安迪 冯建新[1,2] DING Yuan-ming;ZHU An-di;FENG Jian-xin(Communication and Network Laboratory,Dalian University,Dalian Liaoning 116622,China;College of Information Engineering,Dalian University,Dalian Liaoning 116622,China)
机构地区:[1]大连大学通信与网络重点实验室,辽宁大连116622 [2]大连大学信息工程学院,辽宁大连116622
出 处:《计算机仿真》2025年第3期226-230,共5页Computer Simulation
基 金:国家自然科学基金资助项目(61901079)。
摘 要:针对传统图像加密算法密钥空间小,相邻像素相关性强,导致安全性低的问题提出一种新算法。首先用改进的约瑟夫算法的初始序列为明文图像进行按行优先与按列优先的置乱操作,并将置乱图像转换为一维序列。使用Sine耦合Logistic三维混沌映射迭代初始值生成混沌序列,通过异或和取模运算对混沌序列和置乱序列进行扩散,得到加密图像。仿真结果表明,以上算法密钥空间大,密钥敏感,相邻像素间相关性弱,直方图分布均匀,信息熵大。因此,以上算法可抵抗穷举攻击、差分攻击和统计分析攻击,通过与其它算法比较可知,上述算法的加密效果更好且是安全有效的。A new algorithm is proposed to address the issue of low security caused by the small key space and strong correlation between adjacent pixels in traditional image encryption algorithms.The proposed algorithm first performs row-first and column-first scrambling operations for plaintext images with the initial sequence of the improved Joseph's algorithm,and converts the permuted images into one-dimensional sequences.The chaotic sequence is generated by iterating the initial values using Sine coupled logistic 3D chaotic mapping,and the chaotic sequence and the scrambled sequence are diffused by dissimilarity and modulo operations to obtain the encrypted image.Simulation results show that the algorithm has a large key space,sensitive keys,weak correlation between neighboring pixels,uniform histogram distribution,and high information entropy.Therefore,the above algorithms can resist exhaustive attacks,differential attacks,and statistical analysis attacks.Compared with other algorithms,it can be seen that the encryption effect of the above algorithms is better and more secure and effective.
分 类 号:TP309.7[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222