0% found this document useful (0 votes)
18 views45 pages

Analytical Study of Hybrid Techniques For Image Encryption and Decryption. 12

Uploaded by

missybrooke562
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
18 views45 pages

Analytical Study of Hybrid Techniques For Image Encryption and Decryption. 12

Uploaded by

missybrooke562
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 45

(/) (/)

Journals (/about/journals) Topics (/topics) Information (/authors)


"#
! (/toggle_desktop_layout_cookie)
Editing Services (/authors/english) Initiatives (/about/initiatives) About

(/about)

Sign In / Sign Up (/user/login)

Submit ( https://susy.mdpi.com/user/manuscripts/upload?
journal=sensors )

Search for Articles:

Title / Keyword

Author / Affiliation / Email

Sensors

All Article Types

Search

Advanced Search

Journals (/about/journals) / Sensors (/journal/sensors) / Volume 20 (/1424-8220/20) /


Issue 18 (/1424-8220/20/18) / 10.3390/s20185162 /

(/journal/sensors)

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 1 of 45
:
Submit to this Journal
(https://susy.mdpi.com/user/manuscripts/upload?
form%5Bjournal_id%5D%3D3)

Review for this Journal


(https://susy.mdpi.com/volunteer/journals/review)

Propose a Special Issue


(/journalproposal/sendproposalspecialissue/sensors)

► Article Menu

Article Menu
Subscribe SciFeed (/1424-
8220/20/18/5162/scifeed_display)

Recommended Articles

Related Info Links $

More by Authors Links $

Table of Contents %

Abstract
&

Introduction
) *
&

(https://www.altmet
&
Literature
Order Article Reprints (/1424-8220/20/18/5162/reprints)

Review
Open Access Article domain=www.mdpi.com&ci
Altmetric
&
Background
Analytical Study of Hybrid Techniques for Image
Study
'
for
Encryption and Decryption
Share

Proposed
by Hybrid (Help
Algorithms

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 2 of 45
:
Image Lal Chowdhary 1  (mailto:[email protected])
Chiranji
+
&

Encryption
(https://orcid.org/0000-0002-5476-1468), Cite

and
Pushpam Virenbhai Patel 2  (mailto:[email protected]),
Decryption
Krupal Jaysukhbhai Kathrotia 2  Discuss in
?
Implementation SciProfiles
(mailto:[email protected]),
&
Performance (https://sciprofi
Muhammad Attique 3  (mailto:[email protected])
Analysis groups/public/1
(https://orcid.org/0000-0002-7237-180X),
of utm_source=mp
Kumaresan Perumal 1  (mailto:[email protected])
Proposed
(https://orcid.org/0000-0001-5563-8325) and
Hybrid -
Muhammad
Algorithms
Fazal Ijaz 4,*  (mailto:[email protected]) Endorse

(https://orcid.org/0000-0001-5206-272X)
Evaluation
.
&

and Comment
1School of Information Technology and Engineering, Vellore Institute of
Result
Technology, Vellore, Tamil Nadu 632014, India
Analysis
2School of Computer Science and Engineering, Vellore Institute of Technology,
Discussion
&

Vellore,
and Tamil Nadu 632014, India
3Department
Comparative of Software, Sejong University, Seoul 05006, Korea
Analysis
4Department of Intelligent Mechatronics Engineering, Sejong University, Seoul
Conclusions
&
05006, Korea
Author to whom correspondence should be addressed.
&
* Author
Contributions
Funding
&

Sensors 2020, 20(18), 5162; https://doi.org/10.3390/s20185162


&
Acknowledgments
(https://doi.org/10.3390/s20185162)
&
Conflicts
Submission
of
received: 17 August 2020 / Revised: 1 September 2020 /
Accepted:
Interest 8 September 2020 / Published: 10 September 2020
&
References
(This article belongs to the Section Sensor Networks
(/journal/sensors/sections/sensornetworks))

$
Download Browse Figures (https://pub.mdpi-

res.com/sensors/sensors-20-05162/article_deploy/html/images/sensors-20-
05162-g001.png?1600226166) (https://pub.mdpi-res.com/sensors/sensors-

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 3 of 45
:
20-05162/article_deploy/html/images/sensors-20-05162-g002.png?
1600226166) (https://pub.mdpi-res.com/sensors/sensors-20-
05162/article_deploy/html/images/sensors-20-05162-g003.png?1600226166)

Versions Notes (/1424-8220/20/18/5162/notes)

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 4 of 45
:
Abstract

The majority of imaging techniques use symmetric and asymmetric cryptography


algorithms to encrypt digital media. Most of the research works contributed in the
literature focus primarily on the Advanced Encryption Standard (AES) algorithm for
encryption and decryption. This paper propose an analysis for performing image
encryption and decryption by hybridization of Elliptic Curve Cryptography (ECC)
with Hill Cipher (HC), ECC with Advanced Encryption Standard (AES) and
ElGamal with Double Playfair Cipher (DPC). This analysis is based on the
following parameters: (i) Encryption and decryption time, (ii) entropy of encrypted
image, (iii) loss in intensity of the decrypted image, (iv) Peak Signal to Noise Ratio
(PSNR), (v) Number of Pixels Change Rate (NPCR), and (vi) Unified Average
Changing Intensity (UACI). The hybrid process involves the speed and ease of
implementation from symmetric algorithms, as well as improved security from
asymmetric algorithms. ECC and ElGamal cryptosystems provide asymmetric key
cryptography, while HC, AES, and DPC are symmetric key algorithms. ECC with
AES are perfect for remote or private communications with smaller image sizes
based on the amount of time needed for encryption and decryption. The metric
measurement with test cases finds that ECC and HC have a good overall solution
for image encryption.
Keywords: cryptography algorithm (/search?q=cryptography+algorithm);
elliptic curve cryptography (/search?q=elliptic+curve+cryptography); hill
cipher (/search?q=hill+cipher); advanced encryption standard (/search?
q=advanced+encryption+standard); double playfair cipher (/search?
q=double+playfair+cipher); encryption and decryption (/search?
q=encryption+and+decryption); peak signal to noise ratio (/search?
q=peak+signal+to+noise+ratio); Number of Pixels Change Rate (NPCR)
(/search?q=Number+of+Pixels+Change+Rate+%28NPCR%29); Unified
Average Changing Intensity (UACI) (/search?
q=Unified+Average+Changing+Intensity+%28UACI%29); lossy compression
(/search?q=lossy+compression)

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 5 of 45
:
1. Introduction

An image provides a lot of information. Almost one-third of our cortical brain


region is dedicated to the visual processing of the perceived information. Images
are a significant source of information. Images have various applications in a
variety of fields such as storing patient medical information, capturing aerial
images by satellite imagery, capturing interplanetary motion images by telescopes,
storing an individual’s identity in the form of fingerprints, or iris images, etc. [1].
Digital communication generates millions of digital data in the form of digital
images. Cryptography is an efficient way to safeguard sensitive information.
Cryptography is a method of storing and transmitting data in a form intended for
reading and processing the information. The advancement of encryption and
decryption leads to an infinite future. Security analysis depicts the schematic
encryption the scheme can endure numerous crypt analytical attacks. Reliability
and protection of information are equally critical to obtain respect from the
recipient for the information obtained [2].
Encryption of images plays a key role if the images are to be kept private and
transmitted securely. The encryption task involves distorting the pixel intensity of
the image input to create a cipher image that is completely different from the
image input. Using the secret keys, the receiver decrypts the images and returns
the original image. There are various private keys used by the sender and receiver
in asymmetric key cryptography which are further used to generate the shared
secret key. On the other hand, symmetric-key cryptography involves encryption
and decryption with a single key that the sender and receiver are secretly known
to have [3].
Most common processes involve symmetric approaches such as AES, DES,
Hill cipher, etc. to protect the information stored in the images [4]. While they are
easy to implement and fast to process, the amount of security given to the image
is lacking for these methods. This is overcome by incorporating asymmetric
techniques such as RSA, ECC, ElGamal, etc. that provide more security but a
trade-off in ease of implementation and feasibility of computations [5,6]. Saied et
al. [7] used an artificial neural network (ANN) algorithm in encryption/decryption
based on specific characteristic features. However, these processes become more
difficult to deploy with time complexity when communicating several encryptions

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 6 of 45
:
and decrypting parameters through an unsecured channel. Elliptic curve and
ElGamal cryptosystems include asymmetric key cryptography, while Hill Cipher,
AES, and Double Playfair Cipher are symmetric key algorithms [8,9]. Asymmetric
key cryptography is highly secure but requires significant computational
complexities that are further eased using asymmetric key cryptography algorithms
in addition to asymmetric key cryptography [10,11].
Digital image encryption and decryption provides full data protection for the
digital image pixels in our proposed research work. To transfer images quickly, we
use a hybrid encryption technique. It provides safety to different devices such as
mobile phones, tablets, etc. The system ensures the integrity of the data that does
not change the information transferred. Since data encryption applies to both rest
and transit information, it provides consistent security that could result in peace of
mind for the people who handle the information. Compression results in reduced
disk consumption and increased write speed, reading speed, and fast file transfer.
The main contributions of this paper are:
A new image encryption approach using symmetric hybrid algorithms ECC with
Hill Cipher, ECC with AES, and ElGamal with Double Playfair Cipher.
The hybrid decryption algorithms using random permutation and dynamic keys.
Our proposed hybridization of algorithm ensure the ease of implementation with
increase in speed from symmetric algorithms. This also improved the security
from asymmetric algorithms.
The efficiency of the proposed algorithm is seen in several tests and
comparisons performed.
The results show that the proposed algorithm is effective to outperform some
key cryptographic algorithms.
The remainder of the paper is organized as follows. Section 2 presents a
literature survey. The background study for proposed hybrid algorithms is covered
in Section 3. The proposed image encryption and decryption implementation are
given in Section 4. Section 5 presented the performance of the proposed
approach. The succeeding Section 6 describes the evaluation and result from the
analysis of the proposed algorithm. Section 7 shows result discussion, followed by
a comparative analysis of proposed hybrid algorithms with an existing algorithm.
Finally, the conclusion is presented in Section 8.

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 7 of 45
:
2. Literature Review

This section deals with related work in the field of image encryption and
decryption. Security becomes a significant problem in today’s environment, for
both storing and transmitting multimedia data. Therefore, data must be protected
from unauthorized access and the attacker must thwart the attack during
transmission. Images have a major role to play in multimedia data. This represents
more information when compared with text details through visualization [12,13].
The application of images in healthcare, education, transportation and law
enforcement, military communication, medical sciences, etc. requires high image
data security only between end-users. Encryption is the mechanism that renders
image unreadable or makes it easy to evaluate [14,15].
Numerous works have been performed to make ECC encryption possible
after each pixel has been mapped to a predefined elliptic curve [16,17,18]. The
algorithm is used to perform faster, but complicated in pre-computation
calculations to find each point of the elliptical curve for a large value of the primary
number used to generate the finite field. It also includes communication of the
wide mapping table through the unreliable channels for the decryption process.
Several research studies have focused mainly on the use of AES as an encryption
and decryption algorithm [19]. While the algorithm claims to perform better than
other methods, it did not include concrete results for the same through a variety of
security and encryption quality metrics, such as Entropy, NPCR, UACI, etc. [20].
The various approaches involve AES with visual cryptography which offers
good results by encrypting the image using AES and the original key using visual
cryptography by converting it to an image. The algorithm is still susceptible to an
attack on the shared image created for the key [21,22]. Hashim et al. [23] used
ElGamal encryption as an asymmetric encryption algorithm and have been tested
using MATLAB. The work concluded that it took an increasing amount of time for
computation using a large prime number as the encryption parameter.
Bhowmick et al. [24] worked on the security of the text encryption provided by
Double Playfair Cipher by using 6 × 6 key matrices over the regular 5 × 5 key
matrices. However, the algorithm failed due to data loss over certain characters,
such as spaces and special symbols. An updated 5 × 5 playfair cipher version is
presented which enables the user to encrypt and decrypt messages for any

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 8 of 45
:
square matrix. The fair play cipher, with the unique encoding instructions, is
introduced as the first digraph cipher. Hardi et al. [25] combined the use of the
ElGamal cryptosystem and the Double Playfair cipher to protect text data using
standard keys for the symmetrical method. While the algorithm appears to be
operating on digital media, it fails to evaluate security measures and metrics.
Image file encryption performed using hybrid cryptography. ElGamal algorithm
used to perform asymmetric encryption and Double Playfair for symmetric
encryption. The result has been proved that these algorithms are capable of
encrypting an image file with an appropriate runtime and encrypted file size while
maintaining the security level.
Hamad et al. [26] worked to increase image encryption protection utilizing
standard Playfair cipher using a modified key of size 16 by 16 on the 8-bit pixel
range. By carrying out an XOR operation using a random mask, the effects are
further enhanced. The additional security of the algorithm through the XOR
function fails if the intruder eavesdrops the mask. An algorithm incorporating XOR
encryption with a rotational process was designed to effectively encrypt images.
Arab et al. [27] proposed the Advanced Encryption Standard (AES) and Visual
Cryptographic techniques for images. Secure image encryption algorithm used for
both AES and Visual Cryptographic techniques to protect the image. The image is
encrypted using AES and an encoding schema has been proposed to convert the
key into shares based on Visual Secret Sharing.
Astya et al. [28] introduced the Cryptography of the Elliptic Curve for images.
The proposed work is designed to provide secure authentication to combine image
encryption with Elliptic Curve Cryptography. The matrix operations are carried out
on the original image matrix, and the transformed image is further encrypted using
a key sequence generated from the elliptic curve. This is a highly secure technique
and difficult to get the original data without the key. The system requires high
computation which makes it slower. Dawahdeh et al. [29] have adopted the
encryption technique incorporating the Elliptic Curve Cryptosystem with Hill
Cipher. The researchers selected ECC asymmetric encryption and Hill Cipher for
symmetric encryption. The proposed algorithms are capable of encrypting an
image file with security measures. More secure as a hybrid approach is used, and
faster in computing. A new self-invertible key matrix technique was proposed. It

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 9 of 45
:
uses single matrix to encrypt the pixels within the image but it takes longer.
Anwar et al. [30] suggested Elliptic Cryptosystem based curve, which is an
efficient public-key cryptosystem and more suitable for limited environments. The
efficiency of the elliptical curve cryptosystem depends heavily on the operation
called point multiplication. This is a highly secure technique and very difficult to get
the original data without a key. More computation is required, making the system
slower. Nagaraj et al. [31] considered a challenging task due to latency, key size,
and security issues with the appropriate algorithms for specific application.
Cryptographic algorithms face various types of attacks, such as brute force
attacks, a man in the middle attack, loop attacks, etc. which remain as threads.
The researcher provides suggestions about the algorithms to be used according to
needs. The concept is either symmetric or asymmetric but not a combination that
limits their functionality.
The work in [32] used a 5D hyperchaotic system with 2 positive Les
(Lyapunov exponent), pixel-level dynamic filtering, DNA computing, and 3D Latin
cubes for image encryption. Interestingly, the work in [33] presented two
cryptosystems approaches as partial encryption and S-box. The approach to
encryption shows high results in simulations. Another mechanism in [34]
mentioned a dynamic state variables selection to dynamically assign chaotic
variables for pixel encryption. The authors in [35] have introduced a cosine-
transform-based chaotic system (CTBCS). The encryption method requires higher-
efficiency scrambling to distinguish neighboring pixels and uses random order
substitution to distribute a small shift to all pixels of the cipher-image in the plain-
image.

3. Background Study for Proposed Hybrid Algorithms

In our research work, there are three different hybrid methods for performing
image encryption and decryption. The key generation of ECC and background
process describes the hybrid algorithms mentioned below.
ECC with Hill Cipher,
ECC with AES,
ElGamal with Double Playfair Cipher.

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 10 of 45
:
3.1. Key Generation of ECC
The overview of an Elliptical Curve Cryptography is specified. Elliptical curves
are used across a finite prime field. Mathematically the curve is defined as:

(𝐹𝑝 ) = {𝑎, 𝑏, 𝑝, 𝐺} (1)

𝑦2 ≡ 𝑥3 + 𝑎𝑥 + 𝑏 (𝑚𝑜𝑑 𝑝) and 4𝑎3 + 27𝑏2 ≢ 0 (𝑚𝑜𝑑 𝑝) (2)

where 𝐹 𝑝 is the finite field over a prime number p with generator G. a, b are curve
parameters.
The generator of the curve G is the point whose point multiplication with
different scalars produces every point on the curve. Further, we define the order of
elliptic curve n as the smallest integer whose scalar point multiplication with
generator G gives us the point at infinity O for the curve, i.e., nG = O. For the
proposed algorithms we need to generate the keys for elliptic curve cryptography.
The key generation algorithm is given below in Algorithm 1.
Algorithm 1: Key Generation

Receiver establishes Elliptic curve parameters: (𝐹𝑝) = {𝑎, 𝑏, 𝑝, 𝐺} ;

Choose a private key nB in the range: {1, 𝑝 − 1} ;

Find the public key: PB = nBG point multiplication over the curve;

Publish the public key PB and the curve parameters (𝐹𝑝) = {𝑎, 𝑏, 𝑝, 𝐺} ;

Sender gets the public key of receiver 𝑃𝐵 along with associated curve parameters;

Sender chooses a private key 𝑛𝐴 in the range: {1, 𝑝 − 1} ;

Sender computes his public key as 𝑃𝐴 = 𝑛𝐴𝐺 ;

The shared secret key (𝑆𝑆𝐾) as computed by the sender will be:

(𝑆𝑆𝐾) = 𝑛𝐴𝑃𝐵 = 𝑛𝐴𝑛𝐵𝐺 = (𝑥, 𝑦) ;

The key generation is added in our proposed algorithm that uses ECC as the
asymmetric approach.
3.2. ECC with Hill Cipher Algorithm for Image Encryption and Decryption
There is hybridization of image encryption and decryption algorithms of ECC
with Hill Cipher. The matrix generated for HC is a self-invertible matrix is

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 11 of 45
:
𝐾𝑚 = 𝐾 − 1 . The size of self-invertible matrix used is 2 × 2 . With 4 × 4 size self-
invertible matrix performs the encryption and decryption process comparatively
faster as well as produces more distortion in the encrypted image by using
maximum number original image pixels to generate the corresponding cipher
pixels. The matrix is extracted from the shared secret key, the matrix need not be
sent with the encrypted image. The algorithms in the work focus on encryption of
grayscale images and given in Algorithm 2.
ECC with Hill Cipher methodology have gained immense momentum as key
picture and shared by both sender and receiver. The encrypted image is formed
when the gray scale image is mixed to the Hill Cipher algorithm. The inverse of
image K-1 is obtained by the receiver. The resulting encrypted image at the
receiver is passed to the Hill Cipher in order to obtain the original image. This
mechanism is illustrated in Figure 1.
Algorithm 2: ECC with Hill Cipher

Input: The image of size 256 ×256 to be encrypted or decrypted.

Elliptic curve parameters: (𝐹𝑝) = {𝑎, 𝑏, 𝑝, 𝐺} .

Output: The corresponding cipher image or original image of size 256 × 256.

1. Key Generation for ECC (The ECC keys are generated as shown in Section 3.1, Algorithm 1;

2. Computing the self-invertible matrix

(a) Compute: 𝐾1 = 𝑥𝐺 = (𝑘11 , 𝑘12 ) and 𝐾2 = 𝑦𝐺 = (𝑘21 + 𝑘22 ) ;

(b) Compute: 𝐾12 = 𝐼2 − 𝑘11 ; 𝐾21 = 𝐼2 + 𝑘11 ; and 𝑘11 + 𝑘22 = 0;

(c) The 4 × 4 self-invertible matrix is derived as:

𝐾𝑚 = [ ]
𝑘 11 𝑘 12
𝑘 𝑘21 𝑘 22

where, 𝐾11 = [ ]
𝑘11 𝑘12
𝑘21 𝑘22

3. Encryption process:

(a) Read the image to be encrypted and collect the image pixels separately for the

channels R, G, and B.

(b) Group every channel of pixels into 4 × 4 matrices and perform matrix multiplication

with computed self-invertible matrix.

(c) The encryption is done using the subsequent formula:

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 12 of 45
:
⎡ 𝑘11 𝑘12 𝑘13 𝑘14 ⎤ ⎡ 𝑝11 𝑝12 𝑝13 𝑝14 ⎤
⎡ 𝑐11 𝑐12 𝑐13 𝑐14 ⎤
⎢ 𝑘21 𝑘24 ⎥ ⎢𝑝 𝑝22 𝑝23 𝑝24 ⎥
⎥⎢ ⎥=⎢ 𝑐24 ⎥
𝐶𝑖 = 𝐾𝑚 · 𝑃 𝑖 = ⎢ ⎢ ⎥ ⎢ ⎥
𝑘22 𝑘23 21 𝑐21 𝑐22 𝑐23
⎢ 𝑘31 𝑘34 ⎥ ⎢ 𝑝32 𝑝33 𝑝34 ⎥ ⎢ 𝑐34 ⎥
⎢ 𝑘32 𝑘33 ⎥ ⎢ 31
𝑝
⎥ ⎢ 31
𝑐 𝑐32 𝑐33 ⎥
⎣ 𝑘41 𝑘42 𝑘43 𝑘44 ⎦ ⎣ 𝑝41 𝑝42 𝑝43 𝑝44 ⎦ ⎣ 𝑐41 𝑐42 𝑐43 𝑐44 ⎦

where, 𝐾𝑚 is the self-invertible matrix and 𝑃 𝑖 is the current input image block to be encrypted;

(d) Allocate the cipher pixels exactly to the same position as of the corresponding input

image pixels. A cipher image is formed of size identical to the size of input image.

(e) Send the cipher image and ECC public key to the receiver. The encryption process

can be visualized as in Figure 1.

4. Decryption process

(a) Compute the shared secret key from the public key of sender as:

𝑆𝑆𝐾 = 𝑛𝐵𝑃𝐴 = 𝑛𝐵𝑛𝐴𝐺 = 𝑛𝐴𝑛𝐵𝐺 = (𝑥, 𝑦)

(b) Compute the self-invertible matrix exactly as described above using the shared

secret key.

(c) Group the cipher pixels into 4 × 4 matrices and perform matrix multiplication with

self-invertible matrix from Step 2.

(d) Allocate the plain text pixels to the same position as of the corresponding cipher

pixels. The original image is formed back and retrieved as without any intensity loss.

Figure 1. Elliptic Curve Cryptography (ECC) with hill cipher.

3.3. ECC with AES for Image Encryption and Decryption


Hybrid algorithms Elliptic Curve Cryptography (ECC) with AES is performed
for image encryption and decryption (Algorithm 3). AES key and initialization
vector (IV) must be of equal length and it should be a multiple of 16 or 24 or 32
bytes respectively for AES-128, AES-192 or AES-256 encryption/decryption. The
AES encryption and decryption is performed using the Cipher Feedback (CFB)

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 13 of 45
:
mode. If the Electronic Code Book (ECB) mode is used then the initialization
vector (IV) is not required. The AES encrypted bytes are converted to large
integers to save the number of operations by encrypting 2 × groupsize number of
bytes in one ECC operation. Base 256 representations is chosen as it would have
values 0 to 255 in it and the algorithm is working on an 8-bit image whose pixel
intensities also range from 0 to 255. While performing ECC encryption, we make
use of point addition formula to encrypt any point on the XY-plane. The advantage
of such an operation saves from creating a mapping table which becomes
computationally impossible if a very large prime number is used for generating the
finite field and sharing it between the users. On performing decryption simply
reflect the SSK co-ordinates for the x-axis and taking modulus p. The reflected
point is then used with the point addition formula for performing the inverse
operation used an encryption method.
Algorithm 3: ECC with AES

Input: The image of size 256 × 256 to be encrypted or decrypted.

Elliptic curve parameters: (𝐹𝑝) = {𝑎, 𝑏, 𝑝, 𝐺} .

AES symmetric key and initialization vector (IV).

Output: The corresponding cipher image or original image of size 256 × 256.

1. Key Generation for ECC

(The ECC keys are generated as shown in Section 3.1);

2. Key Generation for AES

(a) Sender randomly generates 16 bytes long AES symmetric key and the

Initialization Vector;

(b) These parameters must be securely transmitted to receiver;

3. AES Encryption

(a) Read the image to be encrypted and collect the image pixels separately for the

channels R, G, and B.

(b) Convert the pixels in each channel to bytes using the function (PL) where PL

denotes the list of pixels. The function returns an immutable array of bytes.

(c) Perform AES encryption for each of the channel bytes. This generates bytes in the

encrypted form.

4. ECC Encryption

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 14 of 45
:
(a) Choose a base of representing the numbers. We have chosen 256 to represent the

range of 8-bit pixel values;

(b) Represent the prime number p in base 256 as a list of integers from 0 to 255.

Measure the length of this representation as L. Initialize group size as 𝐿 − 1

(c) Group the cipher bytes from each channel separately with group size initialized

as above. For each of the channels, convert each group of cipher bytes to big

integers treating base of representation as 256. If numbers of big integers are odd,

append with a random value (possibly less than 256);

(d) Pair up the big integers to represent it as a point on the XY-plane. If the

X co-ordinate of the pair and that of the shared secret key are identical, then we

apply point doubling formula over the pair co-ordinates. Otherwise apply point

addition formula with SSK co-ordinates.

(e) From Step 4, we get a point on XY plane not at all necessary to be on the

curve chosen. Represent its co-ordinates in base 256 digits. Each of these.

representations must be of size equal to 𝐿 = 𝑔𝑟𝑜𝑢𝑝𝑠𝑖𝑧𝑒 + 1 . Append 0 zeros

otherwise to make the required length.

(f) The base 256 representations of cipher points are treated as image pixels and cipher

image is constructed correspondingly. The width of cipher image is kept same as

width of input image and height is computed based on the total number of cipher

pixels collected. We observe that size of cipher image is generally more than the

input image.

(g) Send the cipher image, original image size and ECC public key to receiver.

5. ECC Decryption

(a) Compute the shared secret key from the public key of sender as:

SSK = nBPA = nBnAG + nAnBG = (x, y);

(b) Represent the prime number p in base 256 as a list of integers from 0 to 255.

Measure he length of this representation as L. Initialize group size as:

𝑔𝑟𝑜𝑢𝑝𝑠𝑖𝑧𝑒 = 𝐿 − 1

(c) Collect the cipher pixels for each channel and group them with each group size

equal to groupsize + 1;

(d) Convert each group in respective channels to corresponding big integers taking

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 15 of 45
:
base to be 256. Pair up the big integers treating them as points on the XY-plane.

(e) Perform reflection of 𝑆𝑆𝐾 point with respect x-axis: (𝑥, −𝑦 𝑚𝑜𝑑 𝑝) ;

(f) Perform point doubling with reflected 𝑆𝑆𝐾 co-ordinates if the x co-ordinates are

same or perform point addition formula otherwise. The point obtained for each

pair lies on XY-plane but need not be a point the elliptic curve

(g) Represent each of the points obtained in base 256 with each representation of

length equal to groupsize. Append zeros if required.

(h) Obtained values are bytes obtained from AES encryption.

6. AES Decryption

(a) Obtain the AES key and IV from secure communication.

(b) Perform AES decryption for the bytes obtained from above for each of the respective

image channels.

(c) Represent the bytes as the plain text image of size as mentioned by the sender.

3.4. ElGamal with Double Playfair Cipher for Image Encryption and Decryption
The background work carried out for the ElGamal with Double Playfair Cipher
for Image Encryption and Decryption (Algorithm 4). The algorithm uses 2 key
matrices for Double Playfair Cipher but the size of these key matrices used is 16 ×
16 instead of the traditional 5 × 5 keys used in text encryption. The matrix sizes
correspond to the number of distinct pixel values represented by an 8-bit image
which is 0 to 255 or 256 distinct values. The use of key maps increases the speed
of the algorithm to a great extent by saving the time to traverse the entire key
matrices twice in the encryption or decryption process of a single pixel. The
position of a pixel in key matrices is performed with the use of just (2 × 3 × 356) of
extra space and a pre-computation time off (256). The time optimization of the
algorithm reflects when encrypting images for large sizes. Both key matrices are
encrypted using ElGamal encryption before sending it to the receiver. The key
maps can be easily generated on the receiver end once the symmetric keys are
shared and derived.
Algorithm 4: ElGamal with Double Playfair Cipher

Input: The image of size 256 × 256 to be encrypted or decrypted.

The key matrices corresponding to Double Playfair Cipher.

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 16 of 45
:
The ElGamal cryptosystem parameters.

Output: The corresponding cipher image or original image of size 256 × 256.

1. Key Generation for Double Playfair Cipher

(a) A modified key space of 2 matrices, each of size 16 × 16 is used instead of standard

5 × 5 key matrices used in Double Playfair cipher.

(d) Create 2 key maps, 1 corresponding to each of the keys. The key maps have pixel

intensities as keys and their location in the respective key matrix as the

corresponding value (represented by a tuple of row and column).

2. Key Generation for ElGamal Cryptosystem

(a) Receiver chooses a prime number p and computes its generator 𝑔 ≡ 𝑔𝑑(𝑚𝑜𝑑 𝑝)

(b) Publish the public key, prime number p, and generator g.

(c) Sender chooses a random integer i in the range: {2, 𝑝 − 2} .

(d) Sender computes the temporary key or ephemeral key as: 𝐾𝐸 = 𝑔𝑖 (𝑚𝑜𝑑 𝑝)

(e) The masking key is computed by sender as: 𝐾𝐸 ≡ 𝐾𝑝𝑢𝑏𝑖 (𝑚𝑜𝑑 𝑝).

3. Encryption process

(a) Read the image to be encrypted and separate it to different channels as R, G, B.

Pair up pixels in 2 for each of the channels separately.

(b) To apply Vertical Double Playfair Cipher find the location of first value from pixel

pair from the first key map and the location of second pixel value from the second

key map. Then if the pixels are in same column keep them unchanged, else find the

pixel intensities at the opposite corners of the rectangle formed by the pair of input

pixels considered. Place them in the same order as they correspond to the order of

pixel values in the input pair.

(c) Substitute the cipher pixel values to create the cipher image of size identical to that

of the input image.

(d) Encrypt each of the key matrices using the masking key from ElGamal Encryption as:

𝑐𝑖𝑗 ≡ 𝑝𝑖𝑗 × 𝐾𝑀 (𝑚𝑜𝑑 𝑝)

where 𝑝𝑖𝑗 denotes the corresponding pixel intensity in a cell of a key matrix.

(e) Send the encrypted image and encrypted key matrices along with ElGamal public key

(ephemeral key) of sender to the receiver.

4. Decryption process

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 17 of 45
:
(a) The masking key will be computed by receiver as: 𝐾𝑀 ≡ 𝐾𝐸(𝑚𝑜𝑑 𝑝) .

(b) The key matrices for Double Playfair Cipher are decrypted as:

𝑝𝑖𝑗 = 𝑐𝑖𝑗 × (𝐾𝑀 − 1) (𝑚𝑜𝑑 𝑝) .

(c) Read the image to be decrypted and separate it to different channels as R, G, B.

Pair up pixels in 2 for each of the channels separately.

(d) To apply Vertical Double Playfair Cipher find the location of first value from pixel

pair from the first key map and the location of second pixel value from the second

key map. Then if the pixels are in same column, keep them unchanged.

Otherwise, find the pixel intensities at the opposite corners of the rectangle

formed by the pair of input pixels considered. Place them in the same order as they

correspond to the order of pixel values in the input pair.

(e) Substitute the decrypted pixel values to create the original image.

4. Image Encryption and Decryption Implementation

The flow diagram for the proposed hybrid encryption and decryption algorithm
is shown in Figure 2 and Figure 3. A connection is established using the key
generated by the Elliptical Curve Cryptography (ECC) asymmetric key algorithm.
The image encryption is by the symmetric hybrid algorithm of Elliptic Curve
Cryptography (ECC) with Hill Cipher, ECC with Advanced Encryption Standard
(AES), and ElGamal with Double Playfair Cipher. The encrypted image is securely
sent to the sender. The image is decrypted by the receiver using this symmetric
hybrid algorithm, and the original image retrieved will be compressed.

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 18 of 45
:
Figure 2. Flow chart for image encryption and decryption.

Figure 3. Parameter analysis of encryption and decryption.

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 19 of 45
:
5. Performance Analysis of Proposed Hybrid Algorithms

In this section, we discuss within detail the proposed hybrid algorithms using
various symmetrical and asymmetrical techniques for image encryption. To
compare all the different methods that have been incorporated further, we have
established such guidelines, both general and specific to an algorithm. The rules
to be followed when choosing certain criteria to perform encryption and decryption
correctly. The complete set of rules helps us to carry out a comparative analysis of
each algorithm and also to evaluate the work done using the same parameters set
for each process.
5.1. General Constraints
The general constraints to be followed for image selection are
The size of the image to be encrypted is 256 × 256 pixels. The size of the
encrypted image is the same as the input image except for the AES with ECC
algorithm where the size of the encrypted image is slightly larger. All decryption
algorithms produce a decrypted image of the same size as the original image.
To hold both Grayscale and RGB images as the user’s choice, we deploy an
algorithm that both encrypts and decrypts all 3 channels (RGB) of the picture
separately.
5.2. Parameters for Comparison
The comparative analysis performed on the basis of the following parameters.
Test samples shown for ECC with Hill Cipher, ECC with AES and ElGamal with
Double Playfair Cipher.
Encryption Time: Encryption is the method used to convert information to a
secret code that masks the true meaning of the information. The time it takes to
encrypt the image is the time to encrypt it.
Decryption Time: Decryption is generally the reverse encryption process. It is
the method of decoding data that has been encrypted in a hidden format. The
time it takes to get the original image back is the time to decrypt it.

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 20 of 45
:
Metric Values for Entropy: 8 expected value for good Encryption process.
Entropy is the randomness of the pixel intensities in the encrypted image. An
entropy value close to 8 is a good encryption algorithm for an 8-bit image.
Values obtained for Eggs (Grayscale), Eggs (Coloured), Mona Lisa (Grayscale)
and Mona Lisa (Coloured) are closure to 8.
Metric Values for PSNR (dB): 10 dB expected value for reconstructed image.
The PSNR block calculates the peak signal-to-noise ratio between two images
in decibels. This ratio is used to measure the quality between the original and
the compressed image. The higher the PSNR, the higher the quality of the
compressed or reconstructed image. Values obtained for Eggs (Grayscale),
Eggs (Coloured), Mona Lisa (Grayscale) and Mona Lisa (Coloured) are between
8 and 9.5.
Metric Values for NPCR (%): 100% expected value for varying number of pixels
from the input image in the encrypted image. NPCR is the change in the number
of pixels of the cipher image when only one pixel of the plain image is changed.
It is an indicative measure of the number of pixels that vary from the input image
in the encrypted image and is expressed as a percentage. Values obtained for
Eggs (Grayscale), Eggs (Coloured), Mona Lisa (Grayscale) and Mona Lisa
(Coloured) are closure to 100%.
Metric Values for UACI (%): 30% expected value for varying number of pixels
from the input image in the encrypted image. UACI measure indicates the
security of the algorithm against differential attacks, such as a plaintext attack, a
cipher-only attack, or a known plaintext attack. Higher value indicates that it is
safer against such attacks. Values obtained for Eggs (Grayscale), Eggs
(Coloured), Mona Lisa (Grayscale) and Mona Lisa (Coloured) are between 26%
to 30.5%.
Squared Error in Decrypted image: The discrepancy between the decrypted
image pixels and the original one. It should be closer to zero for a good
algorithm.

6. Evaluation and Result Analysis

The various test cases help us visualize the input image, the encrypted image
and the decrypted image for each of the proposed hybrid algorithms. The test

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 21 of 45
:
cases performed for input samples of grayscale and coloured images. The
evaluation carried out on metric measurements, visualized maps and histogram
analysis.
6.1. Sample Input and Output
The reference input and output images used for study are Mona Lisa
(Grayscale 256 × 256 Pixels), Mona Lisa (Coloured 256 × 256 Pixels), Eggs
(Grayscale 256 × 256 Pixels), Eggs (Coloured 256 × 256 Pixels). The sample
input and output with proposed encryption and decryption is shown in Table 1.

Table 1. Sample input and output for proposed hybrid algorithms.

6.2. Metric Measurements


The tuple in the table indicates the value of the metrics in the order of (R, G,
and B).
6.2.1. Eggs (Grayscale 256 × 256 Pixels) Image
The metric measurements such as Entropy, PSNR, NPCR, UACI and Mean
Squared Error (MSE) are shown in Table 2 for Eggs (Grayscale) image.

Table 2. Metric measures for Eggs (grayscale).

6.2.2. Eggs (coloured 256 × 256 Pixels) Image


The Entropy, PSNR, NPCR, UACI and Mean Squared Error (MSE) metrics for

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 22 of 45
:
Eggs (coloured) image are shown in Table 3.

Table 3. Metric measures for Mona Lisa (coloured).

6.2.3. Mona Lisa (Grayscale 256 × 256 Pixels) Image


The Metric measurements such as Entropy, PSNR, NPCR, UACI and Mean
Squared Error (MSE) are shown in Table 4 for Mona Lisa (Grayscale) image.

Table 4. Metric measures for Mona Lisa (gray).

6.2.4. Mona Lisa (Coloured 256 × 256 Pixels) Image


The Entropy, PSNR, NPCR, UACI and Mean Squared Error (MSE) metrics for
Mona Lisa (coloured) image are shown in Table 5.

Table 5. Metric measures for Eggs (grayscale).

6.3. Histogram Analysis of the Encrypted Images


Table 6 shows histogram of red, green and blue component of gray scale and

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 23 of 45
:
coloured image (Mona Lisa). It is clearly visible that histogram of cipher image is
fairly uniform and it does not leak any amount of information about the plain image

Table 6. Histogram analysis for encrypted image (Mona Lisa) using hybrid
algorithms.

Table 7 shows histogram of red, green and blue component of gray scale and
coloured image (Egg). It is clearly visible that histogram of cipher image is fairly
uniform and it does not leak any amount of information about the plain image.

Table 7. Histogram analysis for encrypted image (Egg) using hybrid


algorithms.

7. Discussion and Comparative Analysis


7.1. Discussion
The different performance metrics measured in our work evaluate the security
of the encryption provided by the hybrid algorithm to an input image. The entropy
value obtained for Encrypted Image (ECC with Hill Cipher), Encrypted Image
(ECC with AES), and Encrypted Image (ElGamal with Double Playfair cipher)
signifies the randomness of pixel intensities in the encrypted image. Test case
performed for a set of gray and coloured images. An entropy value obtained
closure to 8 for the sample 8-bit image implies a strong encryption algorithm.
Similarly, in the encryption process, a lower value obtained from PSNR

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 24 of 45
:
implies greater randomness. Using the entropy and PSNR measurement value,
ECC with AES and ECC with Hill Cipher introduce significantly high randomness in
image encryption compared to ElGamal with Double Playfair cipher algorithms
NPCR is also a representative measure of the number of pixels that vary from
the input image in the encrypted image and are expressed as a percentage value.
While the NPCR value for the ECC algorithm with a mapping table is 100% , the
lower entropy implies that the probability distribution of the different pixel
intensities is not uniform. Test samples show that the NPCR values for ECC with
Hill Cipher and ECC with AES are very close to 100% .
The UACI measure indicates the security of the algorithm against differential
attacks, such as a plaintext attack chosen, a ciphertext-only attack, or a known-
plaintext attack. A higher UACI value for ECC with AES and ECC with Hill Cipher
suggests that algorithms are more secure against such attacks. While we can also
infer that the UACI value for ElGamal with the Double Playfair algorithm is very
close to the previous algorithms. However, we can also deploy ElGamal with
Double Playfair Cipher for applications that require ease of implementation, speed,
and large image sizes. However, the algorithm fails to combat brute-force attacks
requiring the knowledge of a large number of ciphertexts. This can be minimized
by deploying a new pair of symmetric keys for each set of communications to
protect the ElGamal cryptosystem. While communication overhead increases
slightly, the algorithm can be found to be very useful for applications involving less
frequency of communication between parties.
The NPCR and UACI are designed to test the number of changing pixels and
the number of averaged changed intensity between ciphertext images. The upper-
bound of the NPCR score is 100%, and thus it is believed that the NPCR score of
a secure cipher should be very close to this upper-bound. Experimental results
show the estimated expectations and variance of NPCR and UACI are very close
to the expected values. NPCR or UACI, are random variables dependent on
parameters such as the image size and the format of the image rather than static
values. This shows more resistive to the cipher attack.
7.2. Comparative Analysis
The image encryption and decryption are constructed with our proposed
hybrid algorithms and referred in Table 8.

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 25 of 45
:
Table 8. Comparative analysis of proposed hybrid algorithms.

8. Conclusions

Digital images are sensitive images that must be secured against intruders
through network channel transmission. Different imaging techniques are used to
encrypt images using symmetrical asymmetric and encryption algorithms. Many of
the image algorithms support only either symmetrical encryption and decryption or
asymmetric encryption and decryption. Thus we have researched three different
hybrid methods for the implementation of image encryption such as Hill Cipher
ECC, Advanced Encryption Standard ECC, and Double Playfair Cipher ElGamal.
Test cases performed with a set of grayscale and coloured images and
performance metrics are measured. When calculating all the parameters such as
Encryption Time, Decryption Time, Entropy, Squared Error in Decrypted Image,
PSNR, NPCR, UACI, we can infer which algorithm is better suited to the needs of
the user. The result shows effectiveness with lower values of encryption and
decryption time. The proposed hybrid algorithm Entropy Value obtained has
closure to 8 which is better than existing algorithms. We obtain the lesser value for
Squared Error in the Decrypted image which proved better than other algorithms.
However, the value of the PSNR is higher by the metric scales and the higher the
value of NPCR the better the algorithm is, and higher value of UACI indicates it is
more secured from attacks. Based on the time taken for encryption and
decryption, we can recognize that ECC with AES is computationally intensive and
not feasible for applications involving the protection of large image databases. We
have performed metric measures for two gray scale and two colour images of
256 × 256 pixels Eggs and Mona Lisa. The Entropy, PSNR, UACI, and NPCR
metric measures are effective and have closure to their expected values. So we
will extend this as future work with various images of varying sizes in pixels. ECC

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 26 of 45
:
with AES appears to be good for remote or private communications with smaller
image sizes due to the following reasons: (1) Additional bandwidth is not required
for AES, (2) key length of ECC occupies less storage space, and (3) ECC requires
shorter bandwidth for decryption. To conclude, the ECC and Hill Cipher turn out to
be a good overall alternative for image encryption algorithms.

Author Contributions

This research specifies below the individual contributions: Conceptualization,


P.V.P., K.J.K. and C.L.C.; Data curation, C.L.C. and K.P.; Formal analysis, M.A.
and M.F.I.; Funding acquisition, M.A. and M.F.I.; Investigation; M.A. and K.P.;
Methodology, K.J.K. and P.V.P.; Project administration, C.L.C. and M.F.I.;
Resources, P.V.P. and K.J.K.; Software, C.L.C. and K.P.; Supervision, C.L.C. and
M.F.I.; Validation, M.A. and M.F.I.; Visualization, C.L.C. and M.A.; Writing—Review
and editing, K.P. and M.F.I. All authors have read and agreed to the published
version of the manuscript.

Funding

This research was funded by the Sejong University Research Fund.

Acknowledgments

This research was supported by the Basic Science Research Program


through the NRF, Korea funded by the Ministry of Education
(2020R1G1A1013221).

Conflicts of Interest

The authors declare no conflict of interest.

References

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 27 of 45
:
1. Park, B.; Korbach, A.; Brünken, R. Does thinking-aloud affect learning,
visual information processing and cognitive load when learning with
seductive details as expected from self-regulation perspective? Comput.
Hum. Behav. 2020, 11, 106411. [Google Scholar (https://scholar.google.-
com/scholar_lookup?title=Does+thinking-aloud+affect+learning,+vis-
ual+information+processing+and+cognitive+load+when+learn-
ing+with+seductive+details+as+expected+from+self-regulation+per-
spective?&author=Park,+B.&author=Korbach,+A.&au-
thor=Br%C3%BCnken,+R.&publication_year=2020&journal=Com-
put.+Hum.+Behav.&vol-
ume=11&pages=106411&doi=10.1016/j.chb.2020.106411)] [CrossRef
(https://doi.org/10.1016/j.chb.2020.106411)]
2. Farah, M.B.; Farah, A.; Farah, T. An image encryption scheme based on a
new hybrid chaotic map and optimized substitution box. Nonlinear Dyn.
2019, 99, 1–24. [Google Scholar (https://scholar.google.com/schol-
ar_lookup?title=An+image+encryp-
tion+scheme+based+on+a+new+hybrid+chaotic+map+and+opti-
mized+substitution+box&author=Farah,+M.B.&author=Farah,+A.&au-
thor=Farah,+T.&publication_year=2019&journal=Nonlinear+Dyn.&vol-
ume=99&pages=1%E2%80%9324&doi=10.1007/s11071-019-05413-8)]
[CrossRef (https://doi.org/10.1007/s11071-019-05413-8)]
3. Nita, S.L.; Mihailescu, M.I. A Searchable Encryption Scheme Based on
Elliptic Curves. In Proceedings of the Workshops of the International
Conference on Advanced Information Networking and Applications,
Caserta, Italy, 15–17 April 2020; Springer: Cham, Switzerland, 2020; pp.
810–821. [Google Scholar (https://scholar.google.com/schol-
ar_lookup?title=A+Searchable+Encryption+Scheme+Based+on+Ellip-
tic+Curves&conference=Proceedings+of+the+Workshops+of+the+In-
ternational+Conference+on+Advanced+Information+Network-
ing+and+Applications&author=Nita,+S.L.&author=Mihailes-
cu,+M.I.&publication_year=2020&pages=810%E2%80%93821)]

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 28 of 45
:
4. Sarmah, D.K.; Kulkarni, A.J.; Abraham, A. Cryptography and Digital Image
Steganography Techniques. In Optimization Models in Steganography
Using Metaheuristics; Springer: Cham, Switzerland, 2020; pp. 33–48.
[Google Scholar (https://scholar.google.com/scholar_lookup?ti-
tle=Cryptography+and+Digital+Image+Steganography+Techniques&a
uthor=Sarmah,+D.K.&author=Kulkarni,+A.J.&author=Abra-
ham,+A.&publication_year=2020&pages=33%E2%80%9348)]
5. Mohamed, N.N.; Yussoff, Y.M.; Saleh, M.A.; Hashim, H. Hybrid
Cryptographic Approach for Internet of Hybrid Cryptographic Approach for
Internet of Things Approaches: A Reveiw. J. Inf. Commun. Technol. 2020,
19, 279–319. [Google Scholar (https://scholar.google.com/schol-
ar_lookup?title=Hybrid+Cryptographic+Approach+for+Internet+of+Hy-
brid+Cryptographic+Approach+for+Internet+of+Things+Approach-
es:+A+Reveiw&author=Mohamed,+N.N.&author=Yussoff,+Y.M.&au-
thor=Saleh,+M.A.&author=Hashim,+H.&publication_year=2020&jour-
nal=J.+Inf.+Commun.+Technol.&vol-
ume=19&pages=279%E2%80%93319)]
6. Sharma, S.; Chopra, V. Analysis of AES Encryption with ECC. In
Proceedings of the 17th International Interdisciplinary Conference on
Engineering Science & Management, Dubai, UAE, 1–2 December 2016; pp.
195–201. [Google Scholar (https://scholar.google.com/schol-
ar_lookup?title=Analysis+of+AES+Encryption+with+ECC&confer-
ence=Proceedings+of+the+17th+International+Interdisciplinary+Con-
ference+on+Engineering+Science+&+Management&author=Shar-
ma,+S.&author=Chopra,+V.&publica-
tion_year=2016&pages=195%E2%80%93201)]

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 29 of 45
:
7. Saied, A.; Overill, R.E.; Radzik, T. Detection of known and unknown DDoS
attacks using Artificial Neural Networks. Neurocomputing 2016, 172, 385–
393. [Google Scholar (https://scholar.google.com/scholar_lookup?ti-
tle=Detection+of+known+and+unknown+DDoS+attacks+using+Artifi-
cial+Neural+Networks&author=Saied,+A.&author=Overill,+R.E.&au-
thor=Radzik,+T.&publication_year=2016&journal=Neurocomput-
ing&volume=172&pages=385%E2%80%93393&doi=10.1016/j.neu-
com.2015.04.101)] [CrossRef (https://doi.org/10.1016/j.neu-
com.2015.04.101)]
8. Roy, M.; Deb, N.; Kumar, A.J. Point Generation and Base Point Selection in
ECC: An Overview. Int. J. Adv. Res. Comput. Commun. Eng. 2014, 3, 671
1–6713 (tel:6711–6713). [Google Scholar (https://scholar.google.-
com/scholar_lookup?title=Point+Generation+and+Base+Point+Selec-
tion+in+ECC:+An+Overview&author=Roy,+M.&author=Deb,+N.&au-
thor=Kumar,+A.J.&publication_year=2014&jour-
nal=Int.+J.+Adv.+Res.+Comput.+Commun.+Eng.&vol-
ume=3&pages=6711%E2%80%936713)]
9. Rajesh, S.; Paul, V.; Menon, V.G.; Khosravi, M.R. A secure and efficient
lightweight symmetric encryption scheme for transfer of text files between
embedded IoT devices. Symmetry 2019, 11, 293. [Google Scholar
(https://scholar.google.com/scholar_lookup?title=A+secure+and+effi-
cient+lightweight+symmetric+encryption+scheme+for+trans-
fer+of+text+files+between+embedded+IoT+devices&author=Ra-
jesh,+S.&author=Paul,+V.&author=Menon,+V.G.&author=Khos-
ravi,+M.R.&publication_year=2019&journal=Symmetry&vol-
ume=11&pages=293&doi=10.3390/sym11020293)] [CrossRef
(https://doi.org/10.3390/sym11020293)] [Green Version (https://www.md
pi.com/2073-8994/11/2/293/pdf)]

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 30 of 45
:
10. Li, L.; Abd El-Latif, A.A.; Niu, X. Elliptic curve ElGamal based homomorphic
image encryption scheme for sharing secret images. Signal Process. 2012,
92, 1069–1078. [Google Scholar (https://scholar.google.com/schol-
ar_lookup?title=Elliptic+curve+ElGamal+based+homomorphic+im-
age+encryption+scheme+for+sharing+secret+images&author=Li,+L.&
author=Abd+El-Latif,+A.A.&author=Niu,+X.&publica-
tion_year=2012&journal=Signal+Process.&vol-
ume=92&pages=1069%E2%80%931078&doi=10.1016/j.sig-
pro.2011.10.020)] [CrossRef (https://doi.org/10.1016/j.sig-
pro.2011.10.020)]
11. Mallouli, F.; Hellal, A.; Saeed, N.S.; Alzahrani, F.A. A Survey on
Cryptography: Comparative Study between RSA vs. ECC Algorithms, and
RSA vs. El-Gamal Algorithms. In Proceedings of the 2019 6th IEEE
International Conference on Cyber Security and Cloud Computing
(CSCloud)/2019 5th IEEE International Conference on Edge Computing
and Scalable Cloud (EdgeCom), Paris, France, 21–23 June 2019; IEEE:
Piscataway, NJ, USA, 2019; pp. 173–176. [Google Scholar (https://schol-
ar.google.com/scholar_lookup?title=A+Survey+on+Cryptogra-
phy:+Comparative+Study+between+RSA+vs.+ECC+Algo-
rithms,+and+RSA+vs.+El-Gamal+Algorithms&conference=Proceed-
ings+of+the+2019+6th+IEEE+International+Conference+on+Cyber+Se-
curity+and+Cloud+Computing+(CSCloud)/2019+5th+IEEE+In-
ternational+Conference+on+Edge+Computing+and+Scalable+Cloud+
(EdgeCom)&author=Mallouli,+F.&author=Hellal,+A.&au-
thor=Saeed,+N.S.&author=Alzahrani,+F.A.&publica-
tion_year=2019&pages=173%E2%80%93176)]

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 31 of 45
:
12. Nahta, R.; Jain, T.; Narwaria, A.; Kumar, H.; Gupta, R.K. Image Encryption
Decryption Using Simple and Modified Version of AES. In Smart Systems
and IoT: Innovations in Computing; Springer: Singapore, 2020; pp. 641–
653. [Google Scholar (https://scholar.google.com/scholar_lookup?ti-
tle=Image+Encryption+Decryption+Using+Simple+and+Modified+Ver-
sion+of+AES&author=Nahta,+R.&author=Jain,+T.&author=Nar-
waria,+A.&author=Kumar,+H.&author=Gupta,+R.K.&publica-
tion_year=2020&pages=641%E2%80%93653)]
13. RM, S.P.; Maddikunta, P.K.R.; Parimala, M.; Koppu, S.; Reddy, T.;
Chowdhary, C.L.; Alazab, M. An effective feature engineering for DNN using
hybrid PCA-GWO for intrusion detection in IoMT architecture. Comput.
Commun. 2020, 160, 139–149. [Google Scholar (https://scholar.google.-
com/scholar_lookup?title=An+effective+feature+engineer-
ing+for+DNN+using+hybrid+PCA-GWO+for+intrusion+detec-
tion+in+IoMT+architecture&author=RM,+S.P.&author=Maddikun-
ta,+P.K.R.&author=Parimala,+M.&author=Koppu,+S.&author=Red-
dy,+T.&author=Chowdhary,+C.L.&author=Alazab,+M.&publica-
tion_year=2020&journal=Comput.+Commun.&vol-
ume=160&pages=139%E2%80%93149)]
14. Kaur, M.; Kumar, V. A comprehensive review on image encryption
techniques. Arch. Comput. Methods Eng. 2020, 27, 15–43. [Google Schol-
ar (https://scholar.google.com/scholar_lookup?title=A+comprehen-
sive+review+on+image+encryption+techniques&author=Kaur,+M.&au-
thor=Kumar,+V.&publication_year=2020&journal=Arch.+Com-
put.+Methods+Eng.&vol-
ume=27&pages=15%E2%80%9343&doi=10.1007/s11831-018-9298-8)]
[CrossRef (https://doi.org/10.1007/s11831-018-9298-8)]

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 32 of 45
:
15. Maddikunta, P.K.R.; Gadekallu, T.R.; Al-Ahmari, A.; Abidi, M.H. Location
Based Business Recommendation Using Spatial Demand. Sustainability
2020, 12, 4124. [Google Scholar (https://scholar.google.com/schol-
ar_lookup?title=Location+Based+Business+Recommendation+Us-
ing+Spatial+Demand&author=Maddikunta,+P.K.R.&au-
thor=Gadekallu,+T.R.&author=Al-Ahmari,+A.&author=Abi-
di,+M.H.&publication_year=2020&journal=Sustainability&vol-
ume=12&pages=4124)]
16. Han, Q.; Wang, L.; Lee, Y.; Qin, J. Video encryption scheme using hybrid
encryption technology. Int. J. Internet Protoc. Technol. 2020, 13, 1–8.
[Google Scholar (https://scholar.google.com/scholar_lookup?ti-
tle=Video+encryption+scheme+using+hybrid+encryption+technolo-
gy&author=Han,+Q.&author=Wang,+L.&author=Lee,+Y.&au-
thor=Qin,+J.&publication_year=2020&journal=Int.+J.+Internet+Pro-
toc.+Technol.&vol-
ume=13&pages=1%E2%80%938&doi=10.1504/IJIPT.2020.105046)]
[CrossRef (https://doi.org/10.1504/IJIPT.2020.105046)]
17. Chowdhary, C.L. 3D object recognition system based on local shape
descriptors and depth data analysis. Recent Patents Comput. Sci. 2019, 12,
18–24. [Google Scholar (https://scholar.google.com/scholar_lookup?
title=3D+object+recognition+system+based+on+local+shape+descrip-
tors+and+depth+data+analysis&author=Chowdhary,+C.L.&publica-
tion_year=2019&journal=Recent+Patents+Comput.+Sci.&vol-
ume=12&pages=18%E2%80%9324&doi=10.2174/2213275911666180821
092033)] [CrossRef
(https://doi.org/10.2174/2213275911666180821092033)]

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 33 of 45
:
18. Liu, Y.; Zhang, S. Information security and storage of Internet of Things
based on block chains. Future Gener. Comput. Syst. 2020, 106, 296–303.
[Google Scholar (https://scholar.google.com/scholar_lookup?title=In-
formation+security+and+storage+of+Inter-
net+of+Things+based+on+block+chains&author=Liu,+Y.&au-
thor=Zhang,+S.&publication_year=2020&journal=Future+Gener.+Com-
put.+Syst.&volume=106&pages=296%E2%80%93303&doi=10.1016/j.fu-
ture.2020.01.023)] [CrossRef (https://doi.org/10.1016/j.fu-
ture.2020.01.023)]
19. Tiwari, D.; Singh, A.; Prabhakar, A. Performance Analysis of AES 2020,
RSA and Hashing Algorithm Using Web Technology. In Computing
Algorithms with Applications in Engineering; Springer: Singapore, 2020; pp.
413–418. [Google Scholar (https://scholar.google.com/schol-
ar_lookup?title=Performance+Analy-
sis+of+AES+2020,+RSA+and+Hashing+Algorithm+Using+Web+Tech-
nology&author=Tiwari,+D.&author=Singh,+A.&author=Prab-
hakar,+A.&publication_year=2020&pages=413%E2%80%93418)]
20. Mortajez, S.; Tahmasbi, M.; Zarei, J.; Jamshidnezhad, A. A novel chaotic
encryption scheme based on efficient secret keys and confusion technique
for confidential of DICOM images. Inform. Med. Unlocked 2020, 20,
100396. [Google Scholar (https://scholar.google.com/scholar_lookup?
title=A+novel+chaotic+encryption+scheme+based+on+efficient+se-
cret+keys+and+confusion+technique+for+confidential+of+DICOM+im-
ages&author=Mortajez,+S.&author=Tahmasbi,+M.&author=Zarei,+J.&a
uthor=Jamshidnezhad,+A.&publication_year=2020&journal=In-
form.+Med.+Unlocked&vol-
ume=20&pages=100396&doi=10.1016/j.imu.2020.100396)] [CrossRef
(https://doi.org/10.1016/j.imu.2020.100396)]

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 34 of 45
:
21. Chowdhary, C.L.; Muatjitjeja, K.; Jat, D.S. Three-dimensional object
recognition based intelligence system for identification. In Proceedings of
the 2015 International Conference on Emerging Trends in Networks and
Computer Communications (ETNCC), Windhoek, Namibia, 17–20 May
2015; IEEE: Piscataway, NJ, USA, 2015; pp. 162–166. [Google Scholar
(https://scholar.google.com/scholar_lookup?title=Three-dimension-
al+object+recognition+based+intelligence+system+for+identifica-
tion&conference=Proceedings+of+the+2015+International+Confer-
ence+on+Emerging+Trends+in+Networks+and+Computer+Communi-
cations+
(ETNCC)&author=Chowdhary,+C.L.&author=Muatjitjeja,+K.&au-
thor=Jat,+D.S.&publication_year=2015&pages=162%E2%80%93166)]
22. Jin, X.; Duan, X.; Jin, H.; Ma, Y. A Novel Hybrid Secure Image Encryption
Based on the Shuffle Algorithm and the Hidden Attractor Chaos System.
Entropy 2020, 22, 640. [Google Scholar (https://scholar.google.-
com/scholar_lookup?title=A+Novel+Hybrid+Secure+Image+Encryp-
tion+Based+on+the+Shuffle+Algorithm+and+the+Hidden+Attrac-
tor+Chaos+System&author=Jin,+X.&author=Duan,+X.&au-
thor=Jin,+H.&author=Ma,+Y.&publication_year=2020&journal=En-
tropy&volume=22&pages=640&doi=10.3390/e22060640)] [CrossRef
(https://doi.org/10.3390/e22060640)]
23. Hashim, H.R.; Neamaa, I.A. Image encryption and decryption in a
modification of ElGamal cryptosystem in MATLAB. arXiv 2014,
arXiv:1412.8490. [Google Scholar (https://scholar.google.com/schol-
ar_lookup?title=Image+encryption+and+decryption+in+a+modifica-
tion+of+ElGamal+cryptosystem+in+MATLAB&author=Hashim,+H.R.&a
uthor=Neamaa,+I.A.&publication_year=2014&journal=arXiv)]

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 35 of 45
:
24. Chowdhary, C.L.; Mittal, M.; Pattanaik, P.A.; Marszalek, Z. An efficient
segmentation and classification system in medical images using intuitionist
possibilistic fuzzy C-mean clustering and fuzzy SVM algorithm. Sensors
2020, 20, 3903. [Google Scholar (https://scholar.google.com/schol-
ar_lookup?title=An+efficient+segmentation+and+classification+sys-
tem+in+medical+images+using+intuitionist+possibilistic+fuzzy+C-
mean+clustering+and+fuzzy+SVM+algorithm&author=Chowd-
hary,+C.L.&author=Mittal,+M.&author=Pattanaik,+P.A.&author=Marsza-
lek,+Z.&publication_year=2020&journal=Sensors&vol-
ume=20&pages=3903&doi=10.3390/s20143903)] [CrossRef
(https://doi.org/10.3390/s20143903)]
25. Hardi, S.M.; Tarigan, J.T.; Safrina, N. Hybrid cryptosystem for image file
using elgamal and double Playfair cipher algorithm. In Proceedings of the
2nd International Conference on Computing and Applied Informatics 2017,
IOP Conference Series: Journal of Physics: Conference Series, Medan,
Indonesia, 27 March 2017; Volume 978, p. 012068. [Google Scholar
(https://scholar.google.com/scholar_lookup?title=Hybrid+cryptosys-
tem+for+image+file+using+elgamal+and+double+Playfair+cipher+al-
gorithm&conference=Proceedings+of+the+2nd+International+Confer-
ence+on+Computing+and+Applied+Informatics+2017,+IOP+Confer-
ence+Series:+Journal+of+Physics:+Conference+Series&author=Har-
di,+S.M.&author=Tarigan,+J.T.&author=Safrina,+N.&publica-
tion_year=2017&pages=012068)]
26. Hamad, S.; Khalifa, A.; Elhadad, A.; Rida, S.Z. A modified playfair cipher for
encrypting digital images. Mod. Sci. 2013, 3, 76–81. [Google Scholar
(https://scholar.google.com/scholar_lookup?title=A+modified+play-
fair+cipher+for+encrypting+digital+images&author=Hamad,+S.&au-
thor=Khalifa,+A.&author=Elhadad,+A.&author=Rida,+S.Z.&publica-
tion_year=2013&journal=Mod.+Sci.&vol-
ume=3&pages=76%E2%80%9381&doi=10.20454/jcce.2013.731)]
[CrossRef (https://doi.org/10.20454/jcce.2013.731)]

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 36 of 45
:
27. Arab, A.; Rostami, M.J.; Ghavami, B. An image encryption method based
on chaos system and AES algorithm. J. Supercomput. 2019, 75, 6663–668
2 (tel:6663–6682). [Google Scholar (https://scholar.google.com/schol-
ar_lookup?title=An+image+encryp-
tion+method+based+on+chaos+system+and+AES+algorithm&au-
thor=Arab,+A.&author=Rostami,+M.J.&author=Ghavami,+B.&publica-
tion_year=2019&journal=J.+Supercomput.&vol-
ume=75&pages=6663%E2%80%936682&doi=10.1007/s11227-019-
02878-7)] [CrossRef (https://doi.org/10.1007/s11227-019-02878-7)] [Gree
n Version (https://link.springer.com/content/pdf/10.1007/s11227-019-02
878-7.pdf)]
28. Visu, P.; Sivakumar, N.; Kumaresan, P.; Babu, S.Y.; Ramesh, P.S.
Removing leaf petioles and auto locating apex-base points using straight
line interpolation and bisection. Multimed. Tools Appl. 2020, 79, 5355–5369
(tel:5355–5369). [Google Scholar (https://scholar.google.com/schol-
ar_lookup?title=Removing+leaf+petioles+and+auto+locating+apex-
base+points+using+straight+line+interpolation+and+bisection&au-
thor=Visu,+P.&author=Sivakumar,+N.&author=Kumaresan,+P.&au-
thor=Babu,+S.Y.&author=Ramesh,+P.S.&publication_year=2020&jour-
nal=Multimed.+Tools+Appl.&vol-
ume=79&pages=5355%E2%80%935369&doi=10.1007/s11042-018-6579-
z)] [CrossRef (https://doi.org/10.1007/s11042-018-6579-z)]
29. Dawahdeh, Z.E.; Yaakob, S.N.; Bin Othman, R.R. A new image encryption
technique combining Elliptic Curve Cryptosystem with Hill Cipher. J. King
Saud Univ. Comput. Inf. Sci. 2018, 30, 349–355. [Google Scholar
(https://scholar.google.com/scholar_lookup?title=A+new+image+en-
cryption+technique+combining+Elliptic+Curve+Cryptosys-
tem+with+Hill+Cipher&author=Dawahdeh,+Z.E.&au-
thor=Yaakob,+S.N.&author=Bin+Othman,+R.R.&publica-
tion_year=2018&journal=J.+King+Saud+Univ.+Comput.+Inf.+Sci.&vol-
ume=30&pages=349%E2%80%93355&doi=10.1016/j.jksuci.2017.06.004
)] [CrossRef (https://doi.org/10.1016/j.jksuci.2017.06.004)]

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 37 of 45
:
30. Anwar, M.N.B.; Hasan, M.; Hasan, M.M.; Loren, J.Z.; Hossain, S.T.
Comparative Study of Cryptography Algorithms and Its’ Applications. Int. J.
Comput. Netw. Commun. Secur. 2019, 7, 96–103. [Google Scholar
(https://scholar.google.com/scholar_lookup?title=Compara-
tive+Study+of+Cryptography+Algorithms+and+Its%E2%80%99+Ap-
plications&author=Anwar,+M.N.B.&author=Hasan,+M.&au-
thor=Hasan,+M.M.&author=Loren,+J.Z.&author=Hossain,+S.T.&publi-
cation_year=2019&journal=Int.+J.+Comput.+Netw.+Commun.+Se-
cur.&volume=7&pages=96%E2%80%93103)]
31. Srinivasan, N.; Raju, G.S.V.P. Image Security using ECC Approach. Indian
J. Sci. Technol. 2015, 8, 1–5. [Google Scholar (https://scholar.google.-
com/scholar_lookup?title=Image+Security+using+ECC+Approach&au-
thor=Srinivasan,+N.&author=Raju,+G.S.V.P.&publica-
tion_year=2015&journal=Indian+J.+Sci.+Technol.&vol-
ume=8&pages=1%E2%80%935)]
32. Li, T.; Shi, J.; Li, X.; Wu, J.; Pan, F. Image encryption based on pixel-level
diffusion with dynamic filtering and DNA-level permutation with 3D Latin
cubes. Entropy 2019, 21, 319. [Google Scholar (https://scholar.google.-
com/scholar_lookup?title=Image+encryption+based+on+pixel-lev-
el+diffusion+with+dynamic+filtering+and+DNA-level+permuta-
tion+with+3D+Latin+cubes&author=Li,+T.&author=Shi,+J.&au-
thor=Li,+X.&author=Wu,+J.&author=Pan,+F.&publica-
tion_year=2019&journal=Entropy&vol-
ume=21&pages=319&doi=10.3390/e21030319)] [CrossRef
(https://doi.org/10.3390/e21030319)] [Green Version (https://www.mdpi.
com/1099-4300/21/3/319/pdf)]

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 38 of 45
:
33. Belazi, A.; Abd El-Latif, A.A.; Diaconu, A.V.; Rhouma, R.; Belghith, S.
Chaos-based partial image encryption scheme based on linear fractional
and lifting wavelet transforms. Opt. Lasers Eng. 2017, 88, 37–50. [Google
Scholar (https://scholar.google.com/scholar_lookup?title=Chaos-
based+partial+image+encryption+scheme+based+on+linear+fraction-
al+and+lifting+wavelet+transforms&author=Belazi,+A.&au-
thor=Abd+El-Latif,+A.A.&author=Diaconu,+A.V.&au-
thor=Rhouma,+R.&author=Belghith,+S.&publication_year=2017&jour-
nal=Opt.+Lasers+Eng.&vol-
ume=88&pages=37%E2%80%9350&doi=10.1016/j.opt-
laseng.2016.07.010)] [CrossRef (https://doi.org/10.1016/j.opt-
laseng.2016.07.010)]
34. Chen, J.X.; Zhu, Z.L.; Fu, C.; Yu, H.; Zhang, L.B. A fast chaos-based image
encryption scheme with a dynamic state variables selection mechanism.
Commun. Nonlinear Sci. Numer. Simul. 2015, 20, 846–860. [Google
Scholar (https://scholar.google.com/scholar_lookup?ti-
tle=A+fast+chaos-based+image+encryption+scheme+with+a+dynam-
ic+state+variables+selection+mechanism&author=Chen,+J.X.&au-
thor=Zhu,+Z.L.&author=Fu,+C.&author=Yu,+H.&au-
thor=Zhang,+L.B.&publication_year=2015&journal=Commun.+Nonlin-
ear+Sci.+Numer.+Simul.&vol-
ume=20&pages=846%E2%80%93860&doi=10.1016/j.cnsns.2014.06.032
)] [CrossRef (https://doi.org/10.1016/j.cnsns.2014.06.032)]
35. Hua, Z.; Zhou, Y.; Huang, H. Cosine-transform-based chaotic system for
image encryption. Inf. Sci. 2019, 480, 403–419. [Google Scholar
(https://scholar.google.com/scholar_lookup?title=Cosine-transform-
based+chaotic+system+for+image+encryption&author=Hua,+Z.&au-
thor=Zhou,+Y.&author=Huang,+H.&publication_year=2019&jour-
nal=Inf.+Sci.&vol-
ume=480&pages=403%E2%80%93419&doi=10.1016/j.ins.2018.12.048)]
[CrossRef (https://doi.org/10.1016/j.ins.2018.12.048)]

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 39 of 45
:
© 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open
access article distributed under the terms and conditions of the Creative Commons
Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/ (htt
p://creativecommons.org/licenses/by/4.0/)).

Share and Cite

 (mailto:?
&subject=From%20MDPI%3A%20%22Analytical%20Study%20of%20Hybrid%
20Techniques%20for%20Image%20Encryption%20and%20Decryption"&bod
y=https://www.mdpi.com/823082%3A%0A%0AAnalytical%20Study%20of%20
Hybrid%20Techniques%20for%20Image%20Encryption%20and%20Decryptio
n%0A%0AAbstract%3A%20The%20majority%20of%20imaging%20technique
s%20use%20symmetric%20and%20asymmetric%20cryptography%20algorit
hms%20to%20encrypt%20digital%20media.%20Most%20of%20the%20resear
ch%20works%20contributed%20in%20the%20literature%20focus%20primaril
y%20on%20the%20Advanced%20Encryption%20Standard%20%28AES%29%
20algorithm%20for%20encryption%20and%20decryption.%20This%20paper
%20propose%20an%20analysis%20for%20performing%20image%20encrypti
on%20and%20decryption%20by%20hybridization%20of%20Elliptic%20Curve
%20Cryptography%20%28ECC%29%20with%20Hill%20Cipher%20%28HC%2
9%2C%20ECC%20with%20Advanced%20Encryption%20Standard%20%28AE
S%29%20and%20ElGamal%20with%20Double%20Playfair%20Cipher%20%2
8DPC%29.%20This%20analysis%20is%20based%20on%20the%20following
%20parameters%3A%20%28i%29%20Encryption%20and%20decryption%20ti
me%2C%20%28ii%29%20entropy%20of%20encrypted%20image%2C%20%2
8iii%29%20loss%20in%20intensity%20of%20the%20decrypted%20image%2
C%20%28iv%29%20Peak%20Signal%20to%20Noise%20Ratio%20%28PSNR
%29%2C%20%28v%29%20Number%20of%20Pixels%20Change%20Rate%20
%28NPCR%29%2C%20and%20%28vi%29%20Unified%20Average%20Changi
ng%20Intensity%20%28UACI%29.%20The%20hybrid%20process%20involve
s%20the%20speed%20and%20ease%20of%20implementation%20from%20s
ymmetric%20algorithms%2C%20as%20well%20as%20improved%20security
%20from%20asymmetric%20algorithms.%20ECC%20and%20ElGamal%20cry

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 40 of 45
:
ptosystems%20provide%20asymmetric%20key%20cryptography%2C%20wh
ile%20HC%2C%20AES%2C%20and%20DPC%20are%20symmetric%20key%2
0algorithms.%20ECC%20with%20AES%20are%20perfect%20for%20remote%
20or%20private%20communications%20with%20smaller%20image%20sizes
%20based%20on%20the%20amount%20of%20time%20needed%20for%20en
cryption[...]) (https://twitter.com/intent/tweet?
text=Analytical+Study+of+Hybrid+Techniques+for+Image+Encryption+and+
Decryption&hashtags=mdpisensors&url=https%3A%2F%2Ffanyv88.com%3A443%2Fhttps%2Fwww.mdpi.com
%2F823082&via=Sensors_MDPI) 
( http://www.linkedin.com/shareArticle?
mini=true&url=https%3A%2F%2Ffanyv88.com%3A443%2Fhttps%2Fwww.mdpi.com%2F823082&title=Analytical
%20Study%20of%20Hybrid%20Techniques%20for%20Image%20Encryption
%20and%20Decryption%26source%3Dhttps%3A%2F%2Ffanyv88.com%3A443%2Fhttps%2Fwww.mdpi.com%26
summary%3DThe%20majority%20of%20imaging%20techniques%20use%20
symmetric%20and%20asymmetric%20cryptography%20algorithms%20to%2
0encrypt%20digital%20media.%20Most%20of%20the%20research%20works
%20contributed%20in%20the%20literature%20focus%20primarily%20on%20
the%20Advanced%20Encryption%20Standard%20%28AES%29%20algorithm
%20for%20%5B...%5D)  (https://www.facebook.com/sharer.php?
u=https://www.mdpi.com/823082)  (http://www.reddit.com/submit?
url=https://www.mdpi.com/823082) (http://www.mendeley.com/import/?
url=https://www.mdpi.com/823082)

MDPI and ACS Style


Chowdhary, C.L.; Patel, P.V.; Kathrotia, K.J.; Attique, M.; Perumal, K.; Ijaz, M.F.
Analytical Study of Hybrid Techniques for Image Encryption and Decryption.
Sensors 2020, 20, 5162. https://doi.org/10.3390/s20185162

AMA Style
Chowdhary CL, Patel PV, Kathrotia KJ, Attique M, Perumal K, Ijaz MF. Analytical
Study of Hybrid Techniques for Image Encryption and Decryption. Sensors. 2020;
20(18):5162. https://doi.org/10.3390/s20185162

Chicago/Turabian Style

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 41 of 45
:
Chowdhary, Chiranji Lal, Pushpam Virenbhai Patel, Krupal Jaysukhbhai Kathrotia,
Muhammad Attique, Kumaresan Perumal, and Muhammad Fazal Ijaz. 2020.
"Analytical Study of Hybrid Techniques for Image Encryption and Decryption"
Sensors 20, no. 18: 5162. https://doi.org/10.3390/s20185162

APA Style
Chowdhary, C. L., Patel, P. V., Kathrotia, K. J., Attique, M., Perumal, K., & Ijaz, M.
F. (2020). Analytical Study of Hybrid Techniques for Image Encryption and
Decryption. Sensors, 20(18), 5162. https://doi.org/10.3390/s20185162

/ Note that from the first issue of 2016, this journal uses article numbers
instead of page numbers. See further details here
(https://www.mdpi.com/about/announcements/784).

Article Metrics

Citations
Crossref Web of Scopus ads PubMed PMC
Science

85 109 (https://www.scopus.com/inward/citedby.uri?
10 (https://www.ncbi.nlm.nih.g
16
partnerID=HzOxMe3b&scp=85090781407&origin=inward)
(https://ui.adsabs.harvard.edu/#abs/2020Senso..20
linkname=pubmed_pubmed_citedin&
(https://www.ncbi.nlm.ni
GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS
Google
Scholar

title=Analytical+Study+of+Hybrid+Techniques+for+Image+Encry

Article Access Statistics

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 42 of 45
:
Article access statistics
12.5k

10k

7.5k

5k

2.5k

0k
24 3. 13 2 3 1 2 2 1
.A S . S 3. S . Oc 3. O 3. O . No 2. N
ug ep ep ep t ct ct v ov

Article Views

For more information on the journal statistics, click here (/journal/sensors/stats).


/ Multiple requests from the same IP address are counted as one view.

Sensors (/journal/sensors), EISSN 1424-8220 (tel:1424-8220), Published by MDPI


RSS (/rss/journal/sensors) Content Alert (/journal/sensors/toc-alert)

Further Information

Article Processing Charges (/apc)


Pay an Invoice (/about/payment)
Open Access Policy (/openaccess)
Contact MDPI (/about/contact)
Jobs at MDPI (https://careers.mdpi.com)

Guidelines

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 43 of 45
:
For Authors (/authors)
For Reviewers (/reviewers)
For Editors (/editors)
For Librarians (/librarians)
For Publishers (/publishing_services)
For Societies (/societies)
For Conference Organizers (/conference_organizers)
MDPI Initiatives

Sciforum (https://sciforum.net)
MDPI Books (https://www.mdpi.com/books)
Preprints.org (https://www.preprints.org)
Scilit (https://www.scilit.net)
SciProfiles (https://sciprofiles.com?
utm_source=mpdi.com&utm_medium=bottom_menu&utm_campaign=initiative)
Encyclopedia (https://encyclopedia.pub)
JAMS (https://jams.pub)
Proceedings Series (/about/proceedings)

Follow MDPI

LinkedIn (https://www.linkedin.com/company/mdpi)
Facebook (https://www.facebook.com/MDPIOpenAccessPublishing)
Twitter (https://twitter.com/MDPIOpenAccess)

Subscribe to receive issue release


notifications and newsletters from
MDPI journals

Select options

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 44 of 45
:
Enter your email address...

Subscribe

© 1996-2024 MDPI (Basel, Switzerland) unless otherwise stated

Disclaimer Terms and Conditions (/about/terms-and-conditions)


Privacy Policy (/about/privacy)

https://www.mdpi.com/1424-8220/20/18/5162 21/11/2024, 2 17 PM
Page 45 of 45
:

You might also like