Image encryption algorithm based on a novel 2D logistic-sine-coupling chaos map and bit-level dynamic scrambling

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Concurrency and Computation-Practice & Experience Pub Date : 2024-08-21 DOI:10.1002/cpe.8261
Jie Fang, Kaihui Zhao, Shixiao Liang, Jiabin Wang
{"title":"Image encryption algorithm based on a novel 2D logistic-sine-coupling chaos map and bit-level dynamic scrambling","authors":"Jie Fang,&nbsp;Kaihui Zhao,&nbsp;Shixiao Liang,&nbsp;Jiabin Wang","doi":"10.1002/cpe.8261","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>This paper develops a new image encryption algorithm based on a novel two-dimensional chaotic map and bit-level dynamic scrambling. First, multiple one-dimensional chaotic maps are coupled to construct a novel two dimensions Logistic-Sine-coupling chaos map (2D-LSCCM). The performance analysis shows that the 2D-LSCCM has more complex chaotic characteristics and wider chaotic range than many extant 2D chaos maps. Second, original image matrix combines with hash algorithm SHA-256 to generate a hash value. The initial values of 2D-LSCCM are generated based on the hash value. Third, the original image matrix is divided into multiple sub-matrices by wavelet transform, followed by scrambling by an improved Knuth shuffle algorithm. Fourth, the scrambled multiple sub-matrices are stitched into an image matrix of <span></span><math>\n <semantics>\n <mrow>\n <mi>M</mi>\n <mo>×</mo>\n <mi>N</mi>\n <mo>×</mo>\n <mn>3</mn>\n </mrow>\n <annotation>$$ M\\times N\\times 3 $$</annotation>\n </semantics></math> and converted into a binary matrix. The chaotic sequence generated by 2D-LSCCM is introduced as a control sequence to control the bit-level scrambling of pixel points, which realizes the bit-level dynamic scrambling. Finally, the diffusion operation is performed by parameter <i>par</i> and chaotic sequence to obtain the final encrypted image. The algorithm security analysis and simulation examples demonstrate the effectiveness of the proposed encryption scheme.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 25","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8261","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

This paper develops a new image encryption algorithm based on a novel two-dimensional chaotic map and bit-level dynamic scrambling. First, multiple one-dimensional chaotic maps are coupled to construct a novel two dimensions Logistic-Sine-coupling chaos map (2D-LSCCM). The performance analysis shows that the 2D-LSCCM has more complex chaotic characteristics and wider chaotic range than many extant 2D chaos maps. Second, original image matrix combines with hash algorithm SHA-256 to generate a hash value. The initial values of 2D-LSCCM are generated based on the hash value. Third, the original image matrix is divided into multiple sub-matrices by wavelet transform, followed by scrambling by an improved Knuth shuffle algorithm. Fourth, the scrambled multiple sub-matrices are stitched into an image matrix of M × N × 3 $$ M\times N\times 3 $$ and converted into a binary matrix. The chaotic sequence generated by 2D-LSCCM is introduced as a control sequence to control the bit-level scrambling of pixel points, which realizes the bit-level dynamic scrambling. Finally, the diffusion operation is performed by parameter par and chaotic sequence to obtain the final encrypted image. The algorithm security analysis and simulation examples demonstrate the effectiveness of the proposed encryption scheme.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于新型二维逻辑正弦耦合混沌图和位级动态加扰的图像加密算法
摘要 本文基于新颖的二维混沌图和位级动态加扰,开发了一种新的图像加密算法。首先,将多个一维混沌图耦合在一起,构建了一个新颖的二维逻辑正弦耦合混沌图(2D-LSCCM)。性能分析表明,与许多现有的二维混沌图相比,二维正弦耦合混沌图具有更复杂的混沌特性和更宽的混沌范围。其次,原始图像矩阵与哈希算法 SHA-256 结合生成哈希值。根据哈希值生成 2D-LSCCM 的初始值。第三,通过小波变换将原始图像矩阵划分为多个子矩阵,然后使用改进的 Knuth 洗牌算法进行加扰处理。第四,将扰乱后的多个子矩阵拼接成一个图像矩阵,并转换成二进制矩阵。引入 2D-LSCCM 生成的混沌序列作为控制序列,控制像素点的位级加扰,实现位级动态加扰。最后,通过参数par和混沌序列进行扩散运算,得到最终的加密图像。算法安全性分析和仿真实例证明了所提加密方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
期刊最新文献
Issue Information Improving QoS in cloud resources scheduling using dynamic clustering algorithm and SM-CDC scheduling model Issue Information Issue Information Camellia oleifera trunks detection and identification based on improved YOLOv7
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1