1
|
Hanif M, Iqbal N, Ur Rahman F, Khan MA, Ghazal TM, Abbas S, Ahmad M, Al Hamadi H, Yeun CY. A Novel Grayscale Image Encryption Scheme Based on the Block-Level Swapping of Pixels and the Chaotic System. SENSORS (BASEL, SWITZERLAND) 2022; 22:s22166243. [PMID: 36016001 PMCID: PMC9414669 DOI: 10.3390/s22166243] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Received: 07/22/2022] [Revised: 08/15/2022] [Accepted: 08/17/2022] [Indexed: 06/01/2023]
Abstract
Hundreds of image encryption schemes have been conducted (as the literature review indicates). The majority of these schemes use pixels as building blocks for confusion and diffusion operations. Pixel-level operations are time-consuming and, thus, not suitable for many critical applications (e.g., telesurgery). Security is of the utmost importance while writing these schemes. This study aimed to provide a scheme based on block-level scrambling (with increased speed). Three streams of chaotic data were obtained through the intertwining logistic map (ILM). For a given image, the algorithm creates blocks of eight pixels. Two blocks (randomly selected from the long array of blocks) are swapped an arbitrary number of times. Two streams of random numbers facilitate this process. The scrambled image is further XORed with the key image generated through the third stream of random numbers to obtain the final cipher image. Plaintext sensitivity is incorporated through SHA-256 hash codes for the given image. The suggested cipher is subjected to a comprehensive set of security parameters, such as the key space, histogram, correlation coefficient, information entropy, differential attack, peak signal to noise ratio (PSNR), noise, and data loss attack, time complexity, and encryption throughput. In particular, the computational time of 0.1842 s and the throughput of 3.3488 Mbps of this scheme outperforms many published works, which bears immense promise for its real-world application.
Collapse
Affiliation(s)
- Muhammad Hanif
- Riphah Institute of Informatics, Riphah International University, Malakand Campus, Islamabad 46000, Pakistan
| | - Nadeem Iqbal
- Department of Computer Science and IT, University of Lahore, Lahore 54590, Pakistan
| | - Fida Ur Rahman
- Department of Computer Science and IT, University of Malakand, Chakdara 18800, Pakistan
| | | | - Taher M. Ghazal
- College of Computer and Information Technology, American University in the Emirates, Dubai Academic City, Dubai 503000, United Arab Emirates
- Center for Cyber Security, Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia (UKM), Bangi 43600, Malaysia
| | - Sagheer Abbas
- School of Computer Science, National College of Business Administration and Economics, Lahore 54000, Pakistan
| | - Munir Ahmad
- School of Computer Science, National College of Business Administration and Economics, Lahore 54000, Pakistan
| | - Hussam Al Hamadi
- College of Engineering and IT, University of Dubai, Dubai 14143, United Arab Emirates
| | - Chan Yeob Yeun
- Center for Cyber Physical Systems, Khalifa University, Abu Dhabi 127788, United Arab Emirates
| |
Collapse
|
2
|
Ran W, Wang E, Tong Z. A double scrambling-DNA row and column closed loop image encryption algorithm based on chaotic system. PLoS One 2022; 17:e0267094. [PMID: 35819964 PMCID: PMC9275730 DOI: 10.1371/journal.pone.0267094] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/11/2022] [Accepted: 04/01/2022] [Indexed: 11/19/2022] Open
Abstract
In this paper, a dynamic update algorithm of double scrambling-DNA row and column closed loop based on chaotic system is proposed. The classical scrambling and diffusion structure are used in the whole process. In the scrambling stage, a new pixel reconstruction method is proposed by combining the Hilbert curve with Knuth-Durstenfeld shuffle algorithm to overcome the shortcoming of nearby storage of Hilbert curve. This method reconstructs the pixel matrix of one-dimensional vector according to the Hilbert curve coding method, and achieves good scrambling effect, while reducing its time complexity and space complexity. In the diffusion stage, combining the plaintext row, the ciphertext row and the key row, and taking advantage of the parallel computing power and high storage density of the DNA encoding, the existing block diffusion operation is improved, and the two-round diffusion of the DNA encoding is proposed. When the last line of ciphertext is generated, the first line of ciphertext is updated and the closed-loop dynamic update of the encryption system is realized. Finally, SHA-256 is used to give the secret key and calculate the initial value of the chaotic system. The simulation results show that the “double scrambling-DNA row and column closed loop dynamic” update algorithm proposed in this paper can effectively improve the efficiency of information transmission and have high security.
Collapse
Affiliation(s)
- Weiyu Ran
- Key Lab of Electronic and Communication Engineering, Heilongjiang University, Harbin, China
| | - Erfu Wang
- Electrical Engineering College, Heilongjiang University, Harbin, China
- * E-mail:
| | - Zhiyong Tong
- Section of Data and Information, Heilongjiang Provincial Military Command, Harbin, China
| |
Collapse
|