Image Encryption Using High-Speed Scrambling and ‎Modular Arithmetic

Authors

  • Worud M. Saleh General Directorate of Diyala Education, Diyala , Iraq
  • Mustafa H. Taha General Directorate of Diyala Education, Diyala , Iraq https://orcid.org/0009-0000-7585-2927
  • Riyadh J. Mohammad General Directorate of Diyala Education, Diyala , Iraq

DOI:

https://doi.org/10.24996/ijs.2024.65.10.33

Keywords:

Diffusion, Image encryption, Modular arithmetic, NPCR, UACI

Abstract

With the enormous growth and advancement of the computer industry, it is critically necessary to transmit a large amount of encrypted multimedia data to prevent third parties from attacking one's privacy or misbehaving. This study proposes a new encryption strategy for preserving original images. It is highly effective and has been shown to be resilient against impulsive noise and loss of data. At first, some random data is entered within the perimeter of the image. Then, three rounds of high-speed scrambling and adaptive diffusion for pixels are carried out to mix the contiguous pixels at random and distribute the newly placed data throughout the image. The suggested encryption method can be used to encrypt original images in any form of representation directly. We offer a particular operation to carry out adaptive diffusion for pixel modulo arithmetic. The results of encryption are evaluated using the histogram, which shows a near-zero correlation with a Number of Pixel Change Rate (NPCR) of 099.624, a Unified Average Change Intensity (UACI) of 033.577, and an average entropy of 7.9993. The proposed method can accomplish much better speed and adapt better to impulse noise and loss of data interference than several conventional and cutting-edge encryption methods.

 

Downloads

Published

2024-10-30

Issue

Section

Computer Science

How to Cite

Image Encryption Using High-Speed Scrambling and ‎Modular Arithmetic. (2024). Iraqi Journal of Science, 65(10), 5727-5740. https://doi.org/10.24996/ijs.2024.65.10.33

Similar Articles

1-10 of 541

You may also start an advanced similarity search for this article.