An image encryption algorithm based on new generalized fusion fractal structure

Ahmad, Musheer; Agarwal, Shafali; Alkhayyat, Ahmed; Alhudhaif, Adi; Alenezi, Fayadh; Zahid, Amjad Hussain; Aljehane, Nojood O.

doi:10.1016/j.ins.2022.01.042

Cited by 48 publications

(21 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For comparison, full image encryption and region of interest encryption were performed on medical images of size 512 × 512 and 320 × 320, respectively, with the encryption scheme proposed in this paper. The encryption scheme’s efficiency is determined by the encryption time (ET) and throughput (ETP) [ 54 ]. These computing statistics are expressed as follows:

…”

Section: Simulation Results and Safety Analysismentioning

confidence: 99%

See 1 more Smart Citation

An Encryption Algorithm for Region of Interest in Medical DICOM Based on One-Dimensional eλ-cos-cot Map

Meng

et al. 2022

Entropy

View full text Add to dashboard Cite

Today, with the rapid development of the Internet, improving image security becomes more and more important. To improve image encryption efficiency, a novel region of interest (ROI) encryption algorithm based on a chaotic system was proposed. First, a new 1D eλ-cos-cot (1D-ECC) with better chaotic performance than the traditional chaotic system is proposed. Second, the chaotic system is used to generate a plaintext-relate keystream based on the label information of a medical image DICOM (Digital Imaging and Communications in Medicine) file, the medical image is segmented using an adaptive threshold, and the segmented region of interest is encrypted. The encryption process is divided into two stages: scrambling and diffusion. In the scrambling stage, helical scanning and index scrambling are combined to scramble. In the diffusion stage, two-dimensional bi-directional diffusion is adopted, that is, the image is bi-directionally diffused row by column to make image security better. The algorithm offers good encryption speed and security performance, according to simulation results and security analysis.

show abstract

…”

Section: Simulation Results and Safety Analysismentioning

confidence: 99%

“…[36] 320 × 320 0.186 s 0.120 s 70 39,168 4.98 Ref. [54] 256 × 256 0.010 s ---50 Ref. [55] 512 × 512 0.287 s ---6.9 Ref.…”

Section: Speed Analysismentioning

confidence: 99%

An Encryption Algorithm for Region of Interest in Medical DICOM Based on One-Dimensional eλ-cos-cot Map

Meng

et al. 2022

Entropy

View full text Add to dashboard Cite

show abstract

“…In addition, Belazi and El-Latif [22] proposed a simple algorithm for constructing an S-box using sine chaotic maps. Furthermore, Musheer et al [43] proposed an algorithm to assemble an S-box using generalized fusion fractal structure. Elliptic curves (ECs) have recently gained reputable attention in cryptography and are being used to design strong cryptosystems.…”

Section: A Related Workmentioning

confidence: 99%

Design of Nonlinear Component of Block Cipher Using Gravesian Octonion Integers

et al. 2023

View full text Add to dashboard Cite

Being the only nonlinear component in many cryptosystems, an S-box is an integral part of modern symmetric ciphering techniques that creates randomness and increases confidentiality at the substitution stage of the encryption. The ability to construct a cryptographically strong S-box solely depends on its construction scheme. The primary purpose of an S-box in encryption standards is to establish confusion between the m-bit input into the n-bit output (both m, n >= 2). This article proposed a robust way to construct S-boxes based on the Gravesian octonion integers. We chunk the paper into threefold: firstly, a comprehensive technique for constructing S-box using affine mapping is described. The presented work is developed in such a way that for every valid input, it generates two S-boxes. Secondly, the strength of the newly generated S-box is evaluated by passing through a rigorous security analysis. Finally, a thorough comparison of the newly developed method with some well-known existing schemes is conducted. We mainly targeted some elliptic curve-based S-boxes in comparison by taking the same parameters in our scheme. The computational results and performance analysis reveal that the propose algorithm can construct a large number of distinct S-boxes that are cryptographically secured and create high resistance against various cryptanalysis attacks.

show abstract

“…The encryption technology based on image secret segmentation and sharing completes image encryption through segmentation and merging [17]. Ahmad et al completed the storage, hiding, and transmission of shadow images through image segmentation and sharing [18]. Liang et al proposed a more economical and effective encryption processing method by studying image secret sharing technology [19].…”

Section: Literature Reviewmentioning

confidence: 99%

Application of Image Encryption Algorithm for Wireless Sensor Network in the Security Analysis of Public Big Data

Geng¹,

Yan

2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

To improve the security of the Wireless Sensor Network (WSN), the image encryption algorithm is studied. Firstly, the shortcomings of current image encryption algorithms are compared. Secondly, based on the chaotic system, the color image encryption algorithm of double chaotic cross-diffusion is built, and the encryption platform is constructed in combination with the current development of intelligent equipment. Finally, the performance of the constructed algorithm and platform is evaluated, and the correlation of adjacent pixel pairs in different color channels and different directions of image encryption is verified. The results indicate that in the designed image encryption platform, the channels of different color are encrypted in different directions, and the encryption effect is good. Compared with the evaluation platform, the practicability of the encryption algorithm is good. After the image is encrypted, the correlation between adjacent pixels is significantly reduced. The image is highly correlated with adjacent pixels in three directions in the first three channels of encryption. After the studied algorithm is encrypted, the correlation coefficient value of adjacent pixel pairs is greatly reduced, and the maximum reduction is 0.97. The information entropy of the red, green, and blue channels before encryption is lower than the information entropy of the three-color channels after encryption. The information entropy of the algorithm is closer to the optimal value of the information entropy. For the index values of Unified Average Changing Intensity (UACI) and Number of Pixels Change Rate (NPCR), the average UACI of the algorithm is 99.62%, while the average of the UACI of the literature algorithm is 98.33%. The NPCR value of the algorithm is 33.52%, while the NPCR value of the literature algorithm is 31.23%. The encryption and decryption time of the algorithm is shorter than that of the literature algorithm. The constructed algorithm has high efficiency of encryption and decryption. It provides a reference for the enhancement of the security of image data in the WSN.

show abstract

An image encryption algorithm based on new generalized fusion fractal structure

Cited by 48 publications

References 42 publications

An Encryption Algorithm for Region of Interest in Medical DICOM Based on One-Dimensional eλ-cos-cot Map

An Encryption Algorithm for Region of Interest in Medical DICOM Based on One-Dimensional eλ-cos-cot Map

Design of Nonlinear Component of Block Cipher Using Gravesian Octonion Integers

Application of Image Encryption Algorithm for Wireless Sensor Network in the Security Analysis of Public Big Data

Contact Info

Product

Resources

About