A Fast Image Encryption Scheme Based on Simultaneous Permutation-Diffusion

Kangming Du, Xin Lyu, C. Zhang, Xin Li, Tao Zeng, Liancheng Zhao
{"title":"A Fast Image Encryption Scheme Based on Simultaneous Permutation-Diffusion","authors":"Kangming Du, Xin Lyu, C. Zhang, Xin Li, Tao Zeng, Liancheng Zhao","doi":"10.1145/3561518.3561520","DOIUrl":null,"url":null,"abstract":"In the traditional image encryption algorithm where permutation and diffusion are performed independently, multiple image scans are required, which reduces the encryption efficiency. In this paper, a fast image encryption scheme based on simultaneous permutation-diffusion is proposed, which performs simultaneous permutation-diffusion row by row and column by column. Firstly, the sorting and cyclic-shift are combined for the permutation. The permutation index sequence of the first row/column is obtained by sorting, and the rest is updated by the cyclic-shift operation related to the plain image, which can resist the chosen-plaintext attack. Secondly, cross-diffusion is performed with dynamic index sequences, which enhances the randomness of the diffusion behavior. Finally, the permutation and diffusion are performed at the same time. Therefore, a round of permutation and diffusion only needs to scan the image once, which improves the encryption efficiency. Note that our scheme only needs to generate and sort chaotic sequences with row/column level length, which reduces the iteration times of the chaotic system and sorting length. In addition, all index sequences are updated at row/column level, which is faster than pixel-level. The simulation results and security analysis show that our scheme has higher encryption efficiency than existing similar methods, and has sufficient security to resist common attacks.","PeriodicalId":196224,"journal":{"name":"Proceedings of the 6th International Conference on Graphics and Signal Processing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 6th International Conference on Graphics and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3561518.3561520","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the traditional image encryption algorithm where permutation and diffusion are performed independently, multiple image scans are required, which reduces the encryption efficiency. In this paper, a fast image encryption scheme based on simultaneous permutation-diffusion is proposed, which performs simultaneous permutation-diffusion row by row and column by column. Firstly, the sorting and cyclic-shift are combined for the permutation. The permutation index sequence of the first row/column is obtained by sorting, and the rest is updated by the cyclic-shift operation related to the plain image, which can resist the chosen-plaintext attack. Secondly, cross-diffusion is performed with dynamic index sequences, which enhances the randomness of the diffusion behavior. Finally, the permutation and diffusion are performed at the same time. Therefore, a round of permutation and diffusion only needs to scan the image once, which improves the encryption efficiency. Note that our scheme only needs to generate and sort chaotic sequences with row/column level length, which reduces the iteration times of the chaotic system and sorting length. In addition, all index sequences are updated at row/column level, which is faster than pixel-level. The simulation results and security analysis show that our scheme has higher encryption efficiency than existing similar methods, and has sufficient security to resist common attacks.
一种基于同时置换扩散的快速图像加密方案
在传统的图像加密算法中,排列和扩散是独立进行的,需要对图像进行多次扫描,降低了加密效率。本文提出了一种基于同时排列扩散的快速图像加密方案,该方案逐行、逐列进行同时排列扩散。首先,将排序和循环移位相结合进行排列。通过排序得到第一行/列的排列索引序列,其余部分通过与明文图像相关的循环移位操作更新,可以抵抗选择明文攻击。其次,采用动态索引序列进行交叉扩散,增强了扩散行为的随机性;最后,排列和扩散同时进行。因此,一轮排列扩散只需要扫描一次图像,提高了加密效率。注意,我们的方案只需要生成和排序具有行/列级别长度的混沌序列,这减少了混沌系统的迭代次数和排序长度。此外,所有索引序列都在行/列级别更新,这比像素级别更快。仿真结果和安全性分析表明,该方案比现有的同类方法具有更高的加密效率,并且具有足够的安全性来抵御常见的攻击。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信