PSDCLS: Parallel simultaneous diffusion–confusion image cryptosystem based on Latin square

IF 3.8 2区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Journal of Information Security and Applications Pub Date : 2024-05-16 DOI:10.1016/j.jisa.2024.103785
Ebrahim Zarei Zefreh
{"title":"PSDCLS: Parallel simultaneous diffusion–confusion image cryptosystem based on Latin square","authors":"Ebrahim Zarei Zefreh","doi":"10.1016/j.jisa.2024.103785","DOIUrl":null,"url":null,"abstract":"<div><p>Today, due to the unparalleled growth of multimedia data sharing, especially digital images, between users over insecure channels in real-time applications, cryptography algorithms have gained increasing attention for the secure and efficient transmission. In classical chaos-based image cryptosystems, the confusion and diffusion operations are often applied as two separate and independent phases, which threatens the cryptosystem security. To address these problems, in this paper, a fast image cryptosystem based on parallel simultaneous diffusion–confusion strategy has been proposed using Latin squares, called PSDCLS. It consists of three main steps. First, the initial parameters of the Hénon-Sine chaotic map are produced from SHA256 of both the plain image content and the user’s secret key. Second, a chaos-based random Latin square is constructed by employing the chaotic sequence produced through the Hénon-Sine chaotic map. Third, a parallel simultaneous diffusion–confusion scheme is proposed by using Latin square and vectorization technique to overcome the problems of computational complexity and high risk of separable and iterative confusion–diffusion operations in the classical chaos-based image cryptosystems. To analyze and evaluate the security and performance of PSDCLS cryptosystem, we conducted extensive simulations and experiments on various benchmark images. Experimental results and analyses show that PSDCLS achieves excellent scores for information entropy (<span><math><mrow><mo>&gt;</mo><mn>7</mn><mo>.</mo><mn>99</mn></mrow></math></span>), correlation coefficients close to 0, key space (<span><math><msup><mrow><mn>2</mn></mrow><mrow><mn>512</mn></mrow></msup></math></span>), NPCR (<span><math><mrow><mo>&gt;</mo><mn>99</mn><mo>.</mo><mn>60</mn><mtext>%</mtext></mrow></math></span>), UACI (<span><math><mrow><mo>&gt;</mo><mn>33</mn><mo>.</mo><mn>46</mn><mtext>%</mtext></mrow></math></span>). The encryption time for test images of size 512 × 512 and <span><math><mrow><mn>512</mn><mo>×</mo><mn>512</mn><mo>×</mo><mn>3</mn></mrow></math></span> was around 0.026 and 0.081 s, respectively. Therefore, PSDCLS is highly robust against common cryptographic attacks and serves as a swift cryptosystem for real-time encryption applications. The source code of PSDCLS is accessible at: <span>https://github.com/EbrahimZarei64/PSDCLS</span><svg><path></path></svg>.</p></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"83 ","pages":"Article 103785"},"PeriodicalIF":3.8000,"publicationDate":"2024-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Security and Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2214212624000887","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Today, due to the unparalleled growth of multimedia data sharing, especially digital images, between users over insecure channels in real-time applications, cryptography algorithms have gained increasing attention for the secure and efficient transmission. In classical chaos-based image cryptosystems, the confusion and diffusion operations are often applied as two separate and independent phases, which threatens the cryptosystem security. To address these problems, in this paper, a fast image cryptosystem based on parallel simultaneous diffusion–confusion strategy has been proposed using Latin squares, called PSDCLS. It consists of three main steps. First, the initial parameters of the Hénon-Sine chaotic map are produced from SHA256 of both the plain image content and the user’s secret key. Second, a chaos-based random Latin square is constructed by employing the chaotic sequence produced through the Hénon-Sine chaotic map. Third, a parallel simultaneous diffusion–confusion scheme is proposed by using Latin square and vectorization technique to overcome the problems of computational complexity and high risk of separable and iterative confusion–diffusion operations in the classical chaos-based image cryptosystems. To analyze and evaluate the security and performance of PSDCLS cryptosystem, we conducted extensive simulations and experiments on various benchmark images. Experimental results and analyses show that PSDCLS achieves excellent scores for information entropy (>7.99), correlation coefficients close to 0, key space (2512), NPCR (>99.60%), UACI (>33.46%). The encryption time for test images of size 512 × 512 and 512×512×3 was around 0.026 and 0.081 s, respectively. Therefore, PSDCLS is highly robust against common cryptographic attacks and serves as a swift cryptosystem for real-time encryption applications. The source code of PSDCLS is accessible at: https://github.com/EbrahimZarei64/PSDCLS.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
PSDCLS:基于拉丁方块的平行同步扩散-融合图像加密系统
如今,由于实时应用中用户之间通过不安全信道共享多媒体数据(尤其是数字图像)的需求空前增长,为实现安全高效的传输,密码学算法日益受到关注。在经典的基于混沌的图像密码系统中,混淆和扩散操作通常是作为两个独立的阶段来应用的,这对密码系统的安全性构成了威胁。为了解决这些问题,本文提出了一种基于拉丁方块并行同步扩散-混淆策略的快速图像密码系统,称为 PSDCLS。它包括三个主要步骤。首先,根据纯图像内容和用户密钥的 SHA256 生成 Hénon-Sine 混沌图的初始参数。其次,利用赫农-正弦混沌图产生的混沌序列构建基于混沌的随机拉丁方块。第三,利用拉丁方阵和矢量化技术提出了一种并行同步扩散-混淆方案,以克服经典的基于混沌的图像密码系统中可分离和迭代混淆-扩散操作的计算复杂性和高风险问题。为了分析和评估 PSDCLS 密码系统的安全性和性能,我们在各种基准图像上进行了大量的模拟和实验。实验结果和分析表明,PSDCLS在信息熵(7.99)、相关系数接近0、密钥空间(2512)、NPCR(99.60%)、UACI(33.46%)等方面都取得了优异的成绩。大小为 512 × 512 和 512×512×3 的测试图像的加密时间分别约为 0.026 秒和 0.081 秒。因此,PSDCLS 对常见的加密攻击具有很强的鲁棒性,可作为实时加密应用的快速加密系统。PSDCLS 的源代码可在以下网址获取:https://github.com/EbrahimZarei64/PSDCLS.
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Information Security and Applications
Journal of Information Security and Applications Computer Science-Computer Networks and Communications
CiteScore
10.90
自引率
5.40%
发文量
206
审稿时长
56 days
期刊介绍: Journal of Information Security and Applications (JISA) focuses on the original research and practice-driven applications with relevance to information security and applications. JISA provides a common linkage between a vibrant scientific and research community and industry professionals by offering a clear view on modern problems and challenges in information security, as well as identifying promising scientific and "best-practice" solutions. JISA issues offer a balance between original research work and innovative industrial approaches by internationally renowned information security experts and researchers.
期刊最新文献
Fed-LSAE: Thwarting poisoning attacks against federated cyber threat detection system via Autoencoder-based latent space inspection Lightweight privacy-preserving authenticated key agreements using physically unclonable functions for internet of drones BCRS-DS: A Privacy-protected data sharing scheme for IoT based on blockchain and certificateless ring signature Privacy-preserving verifiable fuzzy phrase search over cloud-based data Robust coverless video steganography based on pose estimation and object tracking
×
引用
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