检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]杭州电子科技大学电子信息学院,浙江杭州310018
出 处:《杭州电子科技大学学报(自然科学版)》2017年第5期1-6,共6页Journal of Hangzhou Dianzi University:Natural Sciences
基 金:国家自然科学基金资助项目(60971046;61281230357);浙江省自然科学基金重点资助项目(LZ12F01001)
摘 要:在传统的Henon二维映射基础上,提出了一种改进型的Henon映射,增加了其序列复杂性和密钥空间.NIST测试表明,改进后的混沌序列具有良好的随机性.为了提高图像加密的安全性,利用此混沌序列设计了一种新的图像加密算法,将产生的两个混沌序列融合在一起组成了一个新的随机序列作为密钥序列.通过仿真验证了算法良好的加解密效果,降低了图像相邻像素间的相关性.解密时,改变其初始密钥后,无法正确解密,表明该算法具有良好的密钥敏感性,而计算所得的密钥空间非常大,表明该算法能有效地抵抗唯密文攻击,因此具有较高的安全性.Based on the traditional Henon two-dimensional mapping, an improved Henon mapping is proposed, which increases the complexity and the key space of the sequence. The NIST tests show that the improved chaotic sequences have good randomness. Then in order to improve the security of image eneryption, a new image encryption algorithm is designed by using this chaotic sequence. And the algorithm fuses the two chaotic sequences to form a new random sequence as the key sequence. The simulation results show that the encryption and decryption effect of the algorithm is good and the correlation between adjacent pixels is reduced. It can't be decrypted correctly after changing the initial encryption key which shows that the algorithm has a good key sensitivity. Then the large key space also shows that the algorithm can effectively resist cipher-text-only attack. So it has high security.
分 类 号:TN919.3[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.166