Kangming Du, Xin Lyu, C. Zhang, Xin Li, Tao Zeng, Liancheng Zhao
{"title":"一种基于同时置换扩散的快速图像加密方案","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":"{\"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}","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}
A Fast Image Encryption Scheme Based on Simultaneous Permutation-Diffusion
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.