CFP last date
20 January 2025
Reseach Article

Image Encryption System based on Length Three Moduli Set

by Damilare Peter Oyinloye
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 179 - Number 42
Year of Publication: 2018
Authors: Damilare Peter Oyinloye
10.5120/ijca2018916989

Damilare Peter Oyinloye . Image Encryption System based on Length Three Moduli Set. International Journal of Computer Applications. 179, 42 ( May 2018), 12-14. DOI=10.5120/ijca2018916989

@article{ 10.5120/ijca2018916989,
author = { Damilare Peter Oyinloye },
title = { Image Encryption System based on Length Three Moduli Set },
journal = { International Journal of Computer Applications },
issue_date = { May 2018 },
volume = { 179 },
number = { 42 },
month = { May },
year = { 2018 },
issn = { 0975-8887 },
pages = { 12-14 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume179/number42/29361-2018916989/ },
doi = { 10.5120/ijca2018916989 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:58:08.339290+05:30
%A Damilare Peter Oyinloye
%T Image Encryption System based on Length Three Moduli Set
%J International Journal of Computer Applications
%@ 0975-8887
%V 179
%N 42
%P 12-14
%D 2018
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Digital images have found usage in almost all our everyday applications. These images sometimes contain confidential and intelligible information which need to be protected when stored on memory or transmitted over networks (Intranet or Internet). Many techniques have been proposed to deal with this security issues in the past. This paper proposes a simple scrambling algorithm to encrypt and decrypt the grey level image based on random number generation and Residue Number System (Forward and Reverse Conversion). The image is first encrypted by changing the position of each pixel in the original image without changing the value of grey level. The original image reads row by row, pixel by pixel and each pixel will take a new position in the scrambled image. The new position is chosen based on random number generation from the random number generator. The key will be generated as a matrix during the encryption process and also the key saves the position of each pixel in the encrypted/scrambled image. The encryption layer transforms the scrambled image to moduli images which automatically adds an extra security layer to our data. The encrypted moduli images is decrypted by decoding the moduli images and converting them back to a single scrambled image (Reverse Conversion) and the single scrambled image back to the Plain and Original Image by using the saved key matrix. This scheme achieves an enhanced image encryption process and a more efficient decryption process without loses of any inherent information of the recovered plain image.

References
  1. Wang .D, Chang C, Liu .Y, Song .G, and Liu .L (2015),” Digital Image Scrambling Algorithm Based on Chaoti Sequence and Decomposition and Recombination of Pixel Values” , International Journal of Network Security, vol.17, PP.322-327.
  2. Liping S,Qin, Liu Bo .Z, Jun Q, Huan L (2008)” Image Scrambling Algorithm Based on Random Shuffling Strategy” 3rd IEEE Conference on Industrial Electronics and Applications, pp. 2278 – 2283.
  3. Radu. B, Cristina D, Iustin .P and Cristina F. (2014) “A New Fast Chaos-Based Image Scrambling Algorithm” 10th international conference on communication, pp 1-4.
  4. Alhassan S, Gbolagade K.A (2013)” Enhancement of the Security of a Digital Image using the Moduli Set 2n-1 ,2n ,2n+1 International Journal of Advanced Research in Computer Engineering & Technology , Volume 2, Issue 7.
  5. Gbolagade K.A, Cotofana S.D (2008) “A Residue to Binary Converter for the {2n+2,2n+1,2n} Moduli Set”, Asilomar Conference on Signals, Systems, and Computers, pp. 1785-1789, California, USA.
  6. Siewobr H, Gbolagade K.A, and Cotofana S.D (2014) “An Efficient Residue-to-Binary Converter for the New Moduli Set {2n/2±1,22n+1,2n+1}”. International Symposium on Integrated Circuits (ISIC 2014), (to appear), Singapore.
  7. Siewobr H, Gbolagade K.A. (2012) “An Area Efficient RNS-to-Binary Converter for the Moduli Set {2n,22n+1-1,2n-1}”. 4th IEEE International  Conference on Adaptive Science and Technology, pp. 104-107, Kumasi, Ghana.
Index Terms

Computer Science
Information Sciences

Keywords

RNS MRC Information Security Encryption RSA Forward Conversion Backward Conversion