基于改進(jìn)廣義Arnold映射的多混沌圖像加密算法
發(fā)布時(shí)間:2019-06-26 14:24
【摘要】:目的針對(duì)Arnold映射圖像置亂效果差以及無(wú)法抵御選擇明文攻擊等問(wèn)題,提出一種改進(jìn)廣義Arnold映射的圖像加密算法,以提高密文圖像的安全性。方法該算法引入Kent映射產(chǎn)生控制參數(shù),先對(duì)圖像進(jìn)行分塊來(lái)削弱圖像的相關(guān)性,對(duì)每塊圖像進(jìn)行Arnold映射位置置亂,然后利用二維logistic映射生成混沌序列,經(jīng)雙曲正切變換處理后按照奇偶序列與置亂圖像進(jìn)行異或運(yùn)算,得到最終密文圖像。結(jié)果該算法得到密圖信息熵為7.9899,像素改變率為99.61%,統(tǒng)一平均變化程度為30.73%。結(jié)論該算法簡(jiǎn)單易執(zhí)行,能有效抵御各種統(tǒng)計(jì)攻擊和明文攻擊,具有密鑰空間大、置亂效果好、魯棒性較強(qiáng)等特點(diǎn)。
[Abstract]:Aim to solve the problems of poor scrambling effect of Arnold mapping image and unable to resist the attack of selected plaintext, an improved image encryption algorithm based on generalized Arnold mapping is proposed to improve the security of ciphertext image. Methods the algorithm introduces Kent mapping to generate control parameters. Firstly, the image is divided into blocks to weaken the correlation of the image, and then the Arnold mapping position of each image is scrambled. Then the chaotic sequence is generated by two-dimensional logistic mapping. After hyperbolic tangent transformation, the XOR operation is carried out according to the odd-even sequence and the scrambled image, and the final ciphertext image is obtained. Results the information entropy of dense graph was 7.9899, the pixel change rate was 99.61%, and the unified average change degree was 30.73%. Conclusion the algorithm is simple and easy to execute, and can effectively resist all kinds of statistical attacks and plaintext attacks. It has the characteristics of large key space, good scrambling effect and strong robustness.
【作者單位】: 南京信息工程大學(xué)電子與信息工程學(xué)院;南京信息工程大學(xué)大氣環(huán)境與裝備技術(shù)協(xié)同創(chuàng)新中心;
【基金】:江蘇省第十一批“六大人才高峰”高層次人才項(xiàng)目 江蘇高校優(yōu)勢(shì)學(xué)科Ⅱ期建設(shè)工程項(xiàng)目
【分類(lèi)號(hào)】:TP309.7;TP391.41
[Abstract]:Aim to solve the problems of poor scrambling effect of Arnold mapping image and unable to resist the attack of selected plaintext, an improved image encryption algorithm based on generalized Arnold mapping is proposed to improve the security of ciphertext image. Methods the algorithm introduces Kent mapping to generate control parameters. Firstly, the image is divided into blocks to weaken the correlation of the image, and then the Arnold mapping position of each image is scrambled. Then the chaotic sequence is generated by two-dimensional logistic mapping. After hyperbolic tangent transformation, the XOR operation is carried out according to the odd-even sequence and the scrambled image, and the final ciphertext image is obtained. Results the information entropy of dense graph was 7.9899, the pixel change rate was 99.61%, and the unified average change degree was 30.73%. Conclusion the algorithm is simple and easy to execute, and can effectively resist all kinds of statistical attacks and plaintext attacks. It has the characteristics of large key space, good scrambling effect and strong robustness.
【作者單位】: 南京信息工程大學(xué)電子與信息工程學(xué)院;南京信息工程大學(xué)大氣環(huán)境與裝備技術(shù)協(xié)同創(chuàng)新中心;
【基金】:江蘇省第十一批“六大人才高峰”高層次人才項(xiàng)目 江蘇高校優(yōu)勢(shì)學(xué)科Ⅱ期建設(shè)工程項(xiàng)目
【分類(lèi)號(hào)】:TP309.7;TP391.41
【相似文獻(xiàn)】
相關(guān)期刊論文 前10條
1 楊雅麗;蔡娜;倪國(guó)強(qiáng);;Digital Image Scrambling Technology Based on the Symmetry of Arnold Transform[J];Journal of Beijing Institute of Technology(English Edition);2006年02期
2 孫燮華;章仁江;;計(jì)算Arnold變換周期的新算法[J];計(jì)算機(jī)技術(shù)與發(fā)展;2008年11期
3 沈艷河;楊彥濤;安建偉;;Arnold變換的周期性及安全性分析[J];科技信息;2012年08期
4 李兵,徐家偉;Arnold變換的周期及其應(yīng)用[J];中山大學(xué)學(xué)報(bào)(自然科學(xué)版);2004年S2期
5 謝建全;謝R,
本文編號(hào):2506254
本文鏈接:http://sikaile.net/kejilunwen/ruanjiangongchenglunwen/2506254.html
最近更新
教材專(zhuān)著