Global Transitions Proceedings 2 (2021) 100–110

Contents lists available at ScienceDirect

Global Transitions Proceedings

journal homepage: www.elsevier.com/locate/gltp

Security analysis and performance evaluation of a new lightweight

cryptographic algorithm for cloud computing
Fursan Thabit a,∗, Sharaf Alhomdy, Associate Prof b, Sudhir Jagtap, Dr, Prof a
a
b

School of Computational Sciences, S.R.T.M. University of organization, Nanded,

India
Faculty of Computer and Information Technology (FCIT), Sana’a University, Yemen

a r t i c l e

i n f o

Keywords:
Security algorithm
Cloud computing security
Light weight cryptography

a b s t r a c t
Nowadays, cloud computing is rapid growth in the IT industry, which provides a new
way to manage the different information systems. The rapid development of
technology makes it essential to use this technology and
to benefit from its advantages. With raising awareness and worries about cloud
services and information security, understanding and knowledge are growing for the
usage of algorithms security into the processes and data
systems. The primary purpose of this research work is to undertake a security
analysis and performance assessment of a new lightweight cryptographic algorithm
for enhancing data security in cloud computing. It focuses
on studying the performance and security analysis algorithm architecture base on
computational time and key
sensitivity, statistical analysis, image histogram, and entropy change analysis in
cloud computing environment.
It also, provides a performance comparison of general symmetric algorithms used to
secure the cloud services:
DES, AES, Blowfish, RC4, HIGH, SF, and SIT.

1. Introduction
Cloud computing is an internet-based technological term that provides several
internet-based remote services, such as infrastructure, data
storage and applications. This involves incorporating a wide variety of
regulations, technologies and controls to preserve the properties, software and
associated resources of cloud computing technology. “The core
concepts of cloud computing are on-demand computing infrastructure,
the establishment of a pay-as-you-go business model for the services
you can use in computing and information technology, dynamic scaling,
and the reduction of upfront capital and overhead costs. With growing
concerns about cloud storage and data protection, popular security algorithms may
be commonly used in cloud application services that use
encryption techniques, especially symmetric algorithms” [1].
Cryptography is used to hide and confidentially store information
from intruders so that only certain people can access it with which it
is intended and safely share that information. Using encryption cryptographic and
authentication methods mitigate security problems [2–5].
Cryptography is the practice of generating a message that safely changes
the data to be transmitted by encrypting the plain text by taking user
data and only performing the reverse decryption procedure that returns
to the original text. Cryptography can solve the issues related to network
data and application protection in cloud computing [6]. “The primary
method to secure confidential information is encryption. Cryptography’s

purpose is to keep data protected from unauthorised uses. With the rapid
growth of encryption science, it is possible to identify an innovative field
of cryptography as symmetric-key cryptography “[6]. “A single encryption /
decryption key - known as symmetric key encryption the same
key uses in both the encryption /decryption operations. The vast volume of data
will be used for encryption due to the use of a single key to
be processed at a very rapid speed” [7]. Inside cloud service providers,
there is no defined process to safeguard and protect data from breaches
and attacks. End-user data is the object of cyber threats, and is protected
by the cloud using method of cryptography which designed to make it
hard for the attacker to decode the cipher text. When the key has a long
length makes the classified text impossible to decode, which makes it
secure relative to short keys.
The previous research “a new lightweight cryptographic algorithm
(NLCA)” showed low-complexity symmetric key comparing with latest
symmetric key algorithms based on architecture, durability, and security standard
[1]. The authors of this paper showed that, the algorithm
needs more analyzing and evaluating. Therefore, this paper is analysis
and evaluated the performance of NLCA. It’s illustrates the impact of security on
could computing, through the performed experiment analysis
using different parameters are key sensitivity (avalanche), correlation
analysis, visual assessment, statistical analysis, time complexity, execution time,
image histogram and image entropy. In addition, performance
comparisons of general symmetric algorithms DES, 3DES, AES, Blowfish,

Corresponding author.
E-mail address: [email protected] (F. Thabit).

https://doi.org/10.1016/j.gltp.2021.01.014
Available online 27 January 2021
2666-285X/© 2021 The Authors. Publishing Services by Elsevier B.V. on behalf of
KeAi Communications Co. Ltd. This is an open access article under the CC
BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
F. Thabit, S. Alhomdy and S. Jagtap

Global Transitions Proceedings 2 (2021) 100–110

RC4, HIGH, and IDEA used to protect cloud services is given in this paper. The rest
of the paper is organized as; terms used in cryptography
review in Section 2. In Section 3, the Security Algorithm Overview
is discussed. Some of the related work is discussed in Section 4. A
new Lightweight Cryptographic Algorithm is discussed in Section 5.
In Section 6 Configuration and evaluation parameters was discussed..
In Section 7 all simulation results based on the evaluation parameters
are presented. The analytical comparisons are presented and discussed
in Section 8. Finally, the conclusion discussed in Section 9.

computing resources can be obtained, by whom, and under what

conditions [14].
E Non-repudiations it implies the right to guarantee that a sender is
unable to dispute the validity of a document’s signature or the transmission of a
message it originated. In other words, it should not be
necessary for a sender later to wrongly dispute that he received a
message [15]
Cryptography offers various more robust methods, and it is possible
to use techniques to provide these security services. Encryption protocols, digital
signatures, and hash functions are such tools.

2. Term used in Cryptography

A Symmetric Algorithms “Cryptographic techniques are always called

symmetric (public key) key; Because it uses a single standard key
for both data encryption and decryption, the most popular symmetric key algorithms
are (“Data Encryption Standard (DES)”, “TripleDES”, “Rivest Cipher 4 (RC4)”,
“International Data Encryption Algorithm (IDEA)”, and “Advanced Encryption Standard
(AES)”) [16].
B Asymmetric algorithms: They are also defined in public key cryptography techniques
as asymmetric key cryptography, which uses two
different keys for both an encryption and decryption process, and
different types of asymmetric algorithms are available (private key
algorithms), such as: “RSA”, “ElGamal”, “Diffie-Hellman”, etc.”[17].
C Hybrid Algorithms a style of encryption technology that incorporates two or more
encryption algorithms is hybrid encryption. In
other words, it is the process of re-encoding an already encrypted
document one or more times using the same or different algorithm.
Encryption and decryption provides an easy opportunity to use many
encryption processes.

The cryptography used mathematical terms [8], for translating plaintext data (P)
into an unreadable cipher-text (C) format. This process
called encryption, whereas convert the cipher-text to a plaintext called
decryption with the set of techniques called cryptographic algorithms
(E) and the decryption algorithm (D) which overturns and generates.
This can be described as
Cipher-text (C= E {P, Key}
Plain-text (C = D {C, Key}
Description of some special definitions in encryption:
• Plain text is the initial input or knowledge that is entered into algorithms from
an intuitive source for the purpose of coding.
• The cipher text is the output of the mixed message as a random flow
of unintelligible coded information
• Encryption algorithm techniques are the basis of the encryption process to
replace and make changes to the plain text to generate the
encrypted text.
• Decryption algorithm is a way to reverse the encrypted text by taking
the encryption key and converting the encoded text to produce plain
text or the first input.
• Keys: They are used as inputs to perform an encryption or decryption
process
• Senders and receivers: They are individuals who interact and exchange the regular
text.

3. Overview of security algorithm in cloud computing

3.1. DES
DES is the early symmetric encryption method established by (IBM
in 1972) and implemented by (NBS) “The National Standard Bureau as
Federal Information Processing Standard (FIPS) in 1977″. DES is a symmetric key
encryption technology used to encrypt electronic data. DES
is a block cipher that uses 64-bit key, but only 56-bit key is effective,
and parity is used for the rest of the bits. It consists of 16 circular
permutations and two original and final permutations [20]. In typical threat
environments, the 56-bit key size that produces 7.2 ∗ 1016 potential
keys provides power to DES [17] as shown in Fig. (1).

The security issues related to cloud computing are end-user data security, network
traffic security, file system security, and host system security, which can be
overcome to some extent through encryption and
thus help organizations in their temporary adoption of cloud computing
[9].
The primary purpose of the use of cryptography is to conform to the
following basic requirements for information security:
A Confidentiality “it attempts to prohibit unauthorised disclosure of
confidential information. Since cloud storage can be accessed from
multiple devices and apps, this can lead to a rise in the number of
access points, which then contributes to the danger of unauthorised
disclosure” [10].Therefore, in order to protect the security of the
data contained in the cloud computing system, certain approaches
such as encryption [11]. have to be applied.
B Integrity “it is a core component of the protection of cloud data
management, ensuring the data can be secured from unauthorised
alteration and erasure” [12] In the cloud world, this is a major problem with the
implementation of authorization mechanisms [13]. The
Authorization defines access privileges to ban unauthorised users for
each authenticated account. However, due to the rise in access points
and device entities, it is important to ensure that access to protected
data is only approved by authorized entities.
C Availability it refers to data, applications software, but also storage
in the cloud computing environment that is accessible to registered
users on demand. Efficiency requires the capacity of a cloud infrastructure to carry
on operations even though other officials are misbehaving [9].
D Authorization this involves determining who is eligible to access data
and other computer resources. Any basic processes and administrative practises
start with it. The policies propose the information and

3.2. 3DES
"Triple Data Encryption Standard (3DES)" was the first project that
was first anticipated by IBM in 1998 and was standardized in ANSI X9.17
and ISO 8732. This algorithm is based on the three main options that
were introduced from the Feistel architecture. The key is 168 bits long
allowed in 16 subkeys with 8 s blocks and is 48 bits long. It uses the
same decryption algorithm” [20] [17] as shown in Fig. (2).
3.3. AES
Due to the need for high protection and performance, the NIST
launched a call for cipher candidates to introduce a new encryption standard in
1997; it is time to replace the current DES and 3DES encryption
algorithm with new AES encryption algorithms. depend on “The Feistel
layout of the AES symmetric block cipher means that the AES algorithm
accepts a 128-bit block size and a set of three 128, 192, 256 key lengths
permitted for 10, 12, and 14 rounds using the same key for both encryption and
decryption. The vector design of Rijndael gives it considerable
protection and the main scale of up to 256 gives it resistance to possible
attacks”[18]. Fig. (3) shows AES algorithm.
101
F. Thabit, S. Alhomdy and S. Jagtap

Global Transitions Proceedings 2 (2021) 100–110

Fig. 3. (A) DES encryption algorithm. (B) 3DES encryption algorithm.

Fig. 1. AES encryption algorithm.

Fig. 4. Encryption in (RC4).

quick speed and ease of execution. It contains the key streams combined with plain
text to output cipher - text during the encryption process. RC4 is a stream cipher
producing bits of pseudorandom streams.
Using bitwise exclusive OR, the main streams are used for encryption.
RC4′s decryption process is carried out in the same manner. In RC4, a
permutation of 256 possible keys is usable with two 8-bit index pointers. With a
variable key length, the permutation is performed using the
key scheduling algorithm [21]as shown in Fig. (5)
3.6. Tiny encryption algorithm (TEA)

Fig. 2. Blowfish encryption algorithm.

The TEA Encoder Algorithm has fewer lines of code, making it easy
to create and implement. This method uses two sets of 32-bit unsigned
number / symbol blocks that can be created from a 64-bit block and
128-bit keys (k [0] - k [3]) to produce results in the form of w [0] and
w [1]. Magic number / Fixed combos are used to avoid Attacks based
on Round Ordination [24], Fig. (6) is described the TEA.

3.4. Blowfishes
A symmetric cipher with a variable key length is a blowfish depend
on A Feistel structure. It has a block size of 64-bits, and the key ranges
from 32 to 448 bits. “It uses 16 rounds and has a wide box that relies
on the key. In the Blowfish algorithm, there are four S boxes, and the
same algorithm is used for decryption in reverse” [19]. as shown in Fig.
(4) Blowfish security lies in the main size that offers a high degree of
protection. Owing to the several rounds used for the master key, it is
invincible against multiple key attacks, rendering such attacks unlikely.

4. Related work
With the spike in threats, the focus is put on making data secure by
cloud storage providers at the end of the customers. Due to the massive
discrepancy, in the option of algorithms for encryption-decryption,
the efficiency of the cloud has been provided low priority. By use the
good “cryptographic algorithm” for the end user, cloud efficiency and
data protection can be accomplished. It is necessary to conduct the algorithm
examination to verify the competence of the specific algorithm for

3.5. RC4
It is a symmetric key and a cipher for streams. To permit wireless
communication, it utilizes WPA and WEP. It is chosen because of its
102
F. Thabit, S. Alhomdy and S. Jagtap

Global Transitions Proceedings 2 (2021) 100–110

gorithm unusable in that context. In recent years, numerous symmetric

key algorithms have been produced and some of these algorithms run
very well, but do have some overheads. In the field of computer security,
especially cryptographic algorithms, there has been a great revolution,
but this basic work deals only with symmetric key cryptographic technique that will
be used in the part of cloud storage security.
Many experiments and analysis have been carried out to strong then
the security of the information and ecosystem of cloud computing using
cryptography and other techniques. The following studies and literature
is considered by the researchers to be important to the security of cloud
computing being suggested. The author through proposing an structure
that incorporates cryptographic algorithms, the “Advanced Encryption
Standard (AES)” algorithm and the “Hash function”, SHA-2 [22],data
security has been enhanced. “The researcher has introduced and applied a secure
cloud storage methods for small and medium-sized enterprises (SMEs)” [23]. These
studies used the technique of integrating
the encryption algorithm (AES) with the hash function (MD5) to obtain data
integrity and anonymity when transmitting data to the cloud.
Also the author has proposed a method to securely send data to a cloud
storage device using Erasure encoding coding and RSA, AES encryption
algorithms. [24]. The study suggested the use of hybrid encryption approaches to
maximize the safety of cloud computing data such as: RSA
Digital Signature, RSA algorithm, Blowfish algorithm encryption / decryption,
Fiestel, and XOR operating algorithms. and The Symmetric
Data Encryption Standard (DES) were described by [25]. Also demonstrated how to
fuse two separate algorithms, such as DES and RSA, to
remove Cloud Storage’s security challenges. The authors identified previous studies
devoted to cloud data security and performed a survey.
They suggested a hybrid protection encryption approach using Blowfish
and MD5 to offer improved security on the cloud server [26]. Others

Fig. 5. TEA block cipher.

unintended and accidental use of algorithms, which may result in performance

degradation in the process of Encrypt or Decrypt. an algorithm
for applications that use real-time data, which for such applications, it
could take a long time to prove a hindrance, and such algorithms end up
taking a lot of power to run computation and storage, rendering the al-

Fig. 6. Describe the TEA block cipher.

103
F. Thabit, S. Alhomdy and S. Jagtap

Global Transitions Proceedings 2 (2021) 100–110

studied on symmetrical cryptographic algorithms for a lightweight were

built and develop for suitable applications, such as L Block, LED. HIGHT,
PRESENT, DESL, CLEFIA, TWINE, RECTANGLE, SIT etc. A lightweight
64-bit block size cryptosystem with 128-bit key was created, iterated in
32 rounds, and carried two types of operations; XOR operation paired
with left or right rotations [27]. the authors described a symmetric block
cipher named CLEFIA-128, developed by Sony and built to be suitable
for both software and hardware, 128-bit block size encryption in 128bit key length,
and 28 Feistel structure rounds [27]. The researcher constructed two different types
of Data Encryption Lightweight systems, i.e.
DESXL. DESL y DESL, on the other hand, in DESXL, instead of separate
ones with no initial and final permutations, a single S-Box u is used
to improve protection by using a 184-bit key. No attack was displayed
against DESL and DESXL, as they said[28]. this work attempted to find
the result in different directions and different parameters of varies cryptographic
algorithms. On the basis of energy consumption, various symmetric key algorithms
were compared and it was found that while AES
is faster than other algorithms, there is an 8 percent improvement in
power consumption [17]. Other studies, depending on multiple simulation
performance, analysed the efficiency of DES, AES, RC2, BLOWFISH,
and RC6 and determined that the algorithms should be well known for
better results” [29].
This article presented performance and security analysis of a new
lightweight algorithm which term [NLCA] architecture base on computational time and
avalanche effect (key sensitivity), entropy change
analysis, image histogram on cloud computing and Also, a performance
comparison of general symmetric algorithms used to protect cloud services is given
in this article: DES, 3DES, AES, Blowfish, RC4, HIGH, and
IDEA.

the data is compromised. In order to generate confusion and confusion, different

operations are carried out to convert a weak key to
strengthen key. The Feistel-based encryption algorithms depend on
various rounds, requiring a different key for each round. The NLCA
algorithm has five rounds for encrypted/decrypted for such a reason,
this needs to generated five unique keys. The algorithm uses block
cipher of 16 bytes (128-bit) which allows 16 bytes (128-bit) key to
be taken from the user as an input to the generation block key [1].
The block will produce five separate keys after conducting substantial operations to
create complexity and diffusion in the input key.
“Logical operations (XOR, XNOR)”, “Matrix multiplication using fix
matrix (FM)”, “left shifting (LS)”, “transposition using Q-table and
permutation using P-table, is done by the Key Generation. Additionally, the block
uses an f function inspired by a revised Khazad block
cipher [30].
B Encryption Block. Once the encoder securely obtains the keys created by the key
generation block via the protected communication
channel, the encryption process is initiated. The encryption process
it has been suggested at [1] takes place. Easy operations, like, XOR,
XNOR, AND, OR left shift (LS), substitution (S boxes), and swapping
methods, are conducted throughout the encryption process to create
confusion and diffusion. These operations increase complexity and
create confusion for the attackers.
C Decryption Block. The computational procedure used for the decryption of the Ci
cipher-text block is exactly the same as the Mi block
encryption method. The 128 -bit long Ci block is first split into 4
sub-blocks, and then handled with the duplicate working keys using
mixed XOR and Sub operations. And since they are the reverse of
the encryption operation, the precise steps for the procedure would
not need to be written.

5. A new lightweight cryptographic algorithm

6. Configuration and Evaluation Parameters
NLCA [1] is a symmetric key block cipher that build on based on the
combination of Feistel and substitution permutation (SP) architectural
methods to improve the complexity of the encryption. The main idea
of the NLCA cryptography is to use is a 16 bytes (128-bit) block cipher
and want 16 bytes (128-bit) key to encrypt the data. The encryption
process requires encryption rounds in a symmetric-key algorithm; each
round always relies on mathematical functions to generate diffusion and
confusion. Encryption algorithms are usually configured to take 10 to
20 rounds on average to keep the encryption process strong enough
to meet device specifications. However, the proposed algorithm is limited to only
five rounds to maximize energy efficiency results, as each
round requires crypto mathematical operations involving 4 bits of data
to work. The proposed algorithm gives an Easy structure effective for
the cloud environment. Use the Network SP (Substitution-Permutation).
The confusion is confronted with too many overlapping rounds of substitution and
transposition and diffusion of Shannon’s Characteristics
that ensure the cipher text being altered in a Pseudo by a random manner.Further,
this algorithm, adopted to introduces mixed operations in
multiple algebraic classes, including XOR and addition operations, to
generate encryption data that will be difficulty for attackers. The details
description of each block of the NLCA algorithm can be found in
[1].
These detailed steps of the procedures are described as follows:

The experimental Performance architecture was performed on a laptop with a (Core

i7) processor in the 91.7 Kb to 1.54 Mb environments
of Windows 10. The NLCA algorithm was evaluated based on some wellknown parameters
used by various authors [31–35] to compare the efficiency of different traditional
algorithms. The evaluation parameters
are as follows:
I Avalanche Test: A well-known parameter that is uses to analyze
an encryption algorithm’s protection (randomness). Avalanche Test
analysis is conducted in order to verify the sensitivity of the encryption scheme
in order to change the initial conditions. It means that
an entirely different cipher-text should be generated by a minor shift
in the encryption key. Because of the use of complex mathematics
to produce the key with the NLCA algorithm, it is shown that the
NLCA algorithm is a more (sensitivity key) than the comparable algorithms.
J Correlation Analysis: The association between encrypted data and
original data is measured in this analysis. Encrypted data with zero
overlap can preferably result in a strong encryption technique.
K Visual Assessment: It is a standard that must be fulfilled on a fully
encrypted output. It checks if the attacker has the ability to infer any
important information through visual analysis of the coded result, so
in the first stage itself, the scheme is said to be aborted. Thus, the
attacker must not be able to infer any useful information from the
coded result for the scheme to be successful, as shown in Table 1.
Through visual analysis of the coded result, the hacker has the ability to extract
any useful information. The proposed algorithm is assumed to be efficient because of
this, and there is no relationship
between the original key and the cryptographic product.
L Statistical Analysis: This analysis is performed to determine the uncertainty
characteristics of the encoded files. The relationship between the encoded data and
the original data is viewed through
an evaluation of the correlation coefficients. An approach that has

• Key Generation Block.

• Encryption Block.
• Decryption Block.
In the following subsections, these blocks will be further clarified in
detail,
A Key Generation Block. The key generation block process is method
used to produce various encryption and decryption keys. The most
significant component in the encryption and decryption process is
the key. If this key is identified to an attacker; the confidentiality of
104
F. Thabit, S. Alhomdy and S. Jagtap

Global Transitions Proceedings 2 (2021) 100–110

stronger confounding properties and can avoid statistical attacks can

be identified through correlation analysis.
M Key-Space Analysis (Brute-Force Attack): Cryptographic programmers can be
particularly flexible to make very fine adjustments to
the key used in the encryption process. The use of a wide key area
ensures the technology is resistant to brute force attacks, for which
you may need to locate the correct key to obtain maximum two-key
size complexity. Therefore, there is no chance for brute force attacks
to break the proposed algorithm.
N Time Complexity: The attacker would need to locate 2128 potential
keys with a 128-bit key size. Therefore, on average, the time complexity of 2128
for finding the correct key is O (1). In fact, NLCA
time complexity is similar to AES, but due to the fact that there are
no more iterations than AES and the rest of similar algorithms, it has
high efficiency.
O Execution time: One of the important parameters to be considered
in the development of an encryption algorithm, along with security
is the execution time. The implementation time of the encryption
algorithm is defined as the total time taken to encrypt / decrypt
specific data. The table displays the execution time of the encryption
of the comparable algorithms in milliseconds with respect to various
file sizes. It is clearly shown that the NLCA takes less time than the
other algorithms.
P Image histogram: (H. Image) is a recently used parameter indicating
the randomness of the distribution of encoded image details. The
histogram of encrypted and unencrypted images is correlated with
this metric to consider the average shift in the intensity of the data
picture attributable to encryption.
Q Image Entropy. Digital images, assembled to form a visual perception of images,
are a mixture of discrete valued pixels. A simple parameter used to analyze the
randomness of the encoded image is the
image entropy index. This parameter calculates the difference between the entropy of
the original and the encoded image. The higher
the modification of entropy, the better the encryption would be. An
image’s entropy can be calculated using the relation given (3)
𝐸=

𝑁
∑

𝑖 = 1Xi(log 2(Xi)) (1)

Where “E” is the entropy, “X” is the probability of the intensity degree
in the image, and “N” is the total number of degrees of intensity.
7. Experimental analysis results
The experiments analysis is conducted on plaintext as well as on image data. The
original and encrypted images for NLCA-128 are shown
in Fig. 7. A full description of the experiments and their results are discussed
below.
A Avalanche Test (Key sensitive):
The results in Table 1 demonstrate that with changing a single bit
in the key or plain text, the new lightweight algorithm will displace
a large number of bits. Because one part of the text or key bits has
shifted like a landslide, NLCA 128 will move 51.55% and 45.70% of
the coding bits respectively. Since the avalanche results for DES-64
is “65.63%” [36] and “44.92%” for AES-128 [32].
B Image Histogram (Intensity Variation): The Intensity Variation (Histogram) is a
very helpful way to evaluate the effects on the picture of
encryption. A straight line should be the desired resulting histogram
after encryption NLCA. The 128-bit architecture shows excellent results. Tiny
variations are noticed in the histogram for a few test images; this is due to their
initial distribution of pressure. The results
of the photos chosen are seen in Fig 8.
C Image Entropy: Entropy is the measure of the information quality
of the data, the increased random the data after encryption is more
complex to identify. Modification of entropy for six popular images.
The entropy changes for four public images, namely, Baboon, Lena,

Fig. 7. Image encryption /decryption.

105
F. Thabit, S. Alhomdy and S. Jagtap

Global Transitions Proceedings 2 (2021) 100–110

Fig. 8. Histogram comparison.

106
F. Thabit, S. Alhomdy and S. Jagtap

Global Transitions Proceedings 2 (2021) 100–110

Table 1
Avalanche test results for NLCA-128.
No

KEY

plaintext

Key Cipher

cipher-text

Avalanche Analysis

01 02 04
05 06 AA BB CC 44 DD EE
88 09 04 05
06

0A 0B 0C 0D 0F 01
02 03 04
05 06 07
08 09 1A
2B

64 25 4F
99 81 32
9E 35 A6
0D A2 84 FD 67 53
50

0.0363

01 02 04
05 06 AA BB CB 44 DD EE
88 09 04 05
06

0A 0B 0C 0D 0F 01
02 03 04
05 06 07
08 09 1A
2B

FF BB
AA 00 00
00 00 00
BB 00 00
AA

0A BB CB
CC DF 22 AF AC 00 00 00
55
FF AA BB
FF

FF BB
AA 00 00
00 EE 00
BB 00 00
AA

0A BB CB
CC DF 22 AF AC 00
00 00 55
FF AA BB
FF

BB CC DD
EE FF
FF AA AB AC AD AF

FF
FF
FF AA
AA
AA
AA
FF
FF
FF AA
AA
AA
AA
BB CC DD
EE FF
FF AA AB AC AD AF

4F 29 4C
71 D3 AB
29 D0 EB
79 AC 69
A2 73 AC
7B
4F 29 4C
71 D3 AB
26 99 EB
79 AC 69
A2 73 AC
7B
42 42 29
40 4A 27
4A 27 BCE
E5 4A 27
E6 80 E6
80
42 42 29
40 4A 27
AE 29 BCE
E5 4A 27
E6 80 E6
80
26 95 E4
3B C9DA 63B4 42 42 E6 80
2A 1F B9
82

BB CC DD
EE 07 FF
FF AA AB AC AD AF

FF
FF
FF AA
AA
AA
AA
FF
FF
FF F7 AA
AA
AA
AA
Average percent value of avalanches

BB CC DD
EE FF
FF AA AB AC AD AF

26 95 E4
3B C9DA 6C46 42 42 E6 80
2A 1F B9
82

42 42 42 42 42 42 42 42
E6 80 E6 80 E6 80 36 80

38 11 DA 6A 8F 51 9A 82
86 27 75 0E A7 F2 26 78

42 42 42 42 42 42 42 40
E6 80 E6 80 E6 80 36 80

38 11 D6 AB 8F 51 8D 84
86 27 85 7B A7 F2 26 47

Table 2
Image Entropy Test for NLCA −128.
No

Image

Dimension

Entropy (ORG)
Entropy (ENC)

Baboon

Lena

Banda

Peppers

128×128
220×220
256×256
128×128
220×220
256×256
256×256
512×512
256×256
512×512

7.2608
7.1662
7.2091
7.4810
7.4618
7.4436
7.5966
7.5217
7.5519
7.5555

7.9891
7.9958
7.9973
7.9885
7.9962
7.9970
7.9969
7.9982
7.9970
7.9992

64 25 87
52 81 32
D6 63 A6
0D CF 1D
FD 67 E5
30
B8 37 5C
CC 29 E4
98 16 F5
6B FF 3A
9A 38 90
2B
B8 37 80
38 29 E4
84 3A F5
6B 81 A2
9A 38 35
71
A3 7F 08
3F C1 EA
F9 7B 9B
7F 8C 0A
12 D5 C7
EE
A3 7F 0F 0A C1 EA F5 78
9B 7F 4D C0 12 D5 16 E9

0.0472

0.0334

0.0366

A Correlation Analysis. Show the statistical relationship that represents

the dependence of one value on another is the association of two
values. There is a major correlation benefit for data points that bear
significant dependence. The association between encrypted data and
original data is measured in this analysis. Encrypted data with zero
overlap can preferably result in a strong encryption technique. The
following formulas can be used in order to measure the association
between plain text.
𝑥,𝑦)
⎫
⎧
𝑟𝑥𝑦 = √ cov(√
𝐷(𝑥) 𝐷(𝑦)
⎪
⎪
∑
⎪cov(𝑥, 𝑦) = 1 𝑁 (𝑥𝑖 − 𝐸(𝑥))(𝑦𝑖 − 𝐸(𝑦))⎪
𝑖
=1
𝑁
⎬
⎨
∑
2
𝐷(𝑥) = 𝑁1 𝑁
⎪
⎪
𝑖=1 (𝑥𝑖 − 𝐸(𝑥))
∑
𝑁
1
⎪
⎪
𝐸(𝑥) = 𝑁 𝑖=1 𝑥𝑖
⎭
⎩

(1)

Where N is the pixels number pairs, x and y is the gray values of two
adjacent pixels, E(x) is the mean, D(x) is the variance and cov(x,
y) is the covariance. The effects of the similarity between the two
neighboring pixels of the Lena plain image and the Lena cipher image
are shown in Fig. 9 This figure shows a substantial reduction in the

Panda, Lena, and Peppers it is described out in Table 2. On average

9.93%, the entropy change is observed with NLCA-128 respectively.
From the results, it is apparent that the proposed NLCA-128 method
is the most suitable option for image coding
107
F. Thabit, S. Alhomdy and S. Jagtap

Global Transitions Proceedings 2 (2021) 100–110

Fig. 9. Correlation analysis.

108
F. Thabit, S. Alhomdy and S. Jagtap

Global Transitions Proceedings 2 (2021) 100–110

Table 3
Results for correlation.
Image

size

Correlation original

Correlation encryption

Baboon
Lena
Banda
Peppers

256×256
256×256
256×256
256×256

0.9000
0.9576
0.9764
0.9309

0.0026
0.0055
0.0012
−0.0031

Table 4
Differential cryptanalysis.
Image

size

NPCR

UACI

Baboon
Lena
Banda
Peppers

256×256
256×256
256×256
256×256

99.5826
99.5758
99.6052
99.6231
26.3210
25.0544
23.0526
31.1101

B Execution time analysisThe time complexity of cryptographic algorithms is now an

important criterion for algorithmic efficiency, particularly in Real-Time Internet
applications and in the era of cloud
computing. The encryption algorithms are implemented in dev C++
for text and MATLAB R2016a for image encryption implement on
a computer with 8.0 GB RAM and Intel(R) Core (TM) i7–6700HQ
CPU 2.60 GHz. The grayscale images “Baboon”, “Lina”, “Pepper" and
“Panda” with a size of 128 ∗ 128, 220 ∗ 220 256 ∗ 256 and 512,512
are used as original images and the experiment is executed 15 times,
and the average execution times are listed for the encryption and decryption
process in Table 5.

Table 5
Execution time analysis of propose algorithm.
No

Image

Image Size

Total ENC/DEC

Baboon

Lena

Banda

Peppers

128
220
256
128
220
256
256
512
256
512

1.1810
3.7104
4.6078
1.2910
3.4531
5.0388
4.7363
19.880
6.0214
25.220

8. Comparison performance NLCA with some Symmetric Key

Algorithm
In this section, the performance analysis process of some symmetric Key algorithms
such RC4, HIGH, SF, AES, SIT, DES and proposed
algorithm in the various parameters (Avalanche Analysis, Correlation
Analysis, Keys-pace analysis, Linear and Differential Cryptanalysis, Information
entropy analysis, Execution time analysis). The results have
been obtained by running the experiments with the varying file sizes
demonstrating the effect of algorithm change. Table 6 It displays the
experimental results of cryptographic algorithms that use the same algorithms as
text files for five experiments. By analysing the table, NLCA
takes less time to encode, RC4 takes less time to encode while AES and
3DES take longer to encode and check memory usage all algorithms that,
NLCA, IDEA, SIT and TEA use significantly less memory while RC4 takes
the maximum of Memory for all algorithms. As well as the resulting
histogram after encryption NLCA. 128-bit architecture shows excellent
results compare to others. The entropy changes results show that the
proposed method NLCA -128 is the most appropriate choice for image
encryption, This encryption scheme would be immune to the differential attack if a
small change of a bit in text or pixel in the plain picture
will lead to a major change in the cipher.

correlation of the two adjacent pixels in the Lena cipher picture. The
result of correlation shown in Fig. 9 and Table 3, respectively.
A Linear and Differential Cryptanalysis The f-function is inspired
by [1], whose cryptanalysis reveals that the complete cypher does
not succeed in differential and linear attacks. The similarity between
input and output it is very high. If the linear approximation is performed for two
Rounds. The round conversion is often kept uniform,
which in a similar way, it handles any bit and gives opposition to
differential attacks.
A secure system of encryption can be very sensitive to plain text or
images. The encryption scheme would be immune to the differential
attack if a small change of a bit in text or pixel in the plain picture
will lead to a major change in the cipher. Significant criteria for differential
attack analysis are NPCR (Number of Pixels Shift Rate) and
UACI (Unified Average Changing Intensity), as described by (26),
(27) [7]. The Table 4 presents the results of Linear and Differential
Cryptanalysis in our proposed work.

9. Conclusion
With the development of advanced technologies in cloud computing, security remains
one of the most important problems in the world
of cloud computing. Use security algorithms and ensure that these algorithms are
properly and reliably applied to protect safety of end users. In

Table 6
shows the comparison in terms avalanche, correlation, key space, information
entropy, and execution time analysis.
No

name
Avalanche
analysis

SEA [35]

Key space
analysis

48

HIGH[36]

SF [36]

0.4570

2 × 64

AES [22]
SIT [37]
DES [34]
NLCA [1]

0.3603
0.4830
0.6756
0.0363

RAM

Differential
Cryptanalysis

Correlation
analysis

entropy
analysis

Execution
time (s)

1570

176

NCPR
–
UACI
–

0.0072

7.4436

2.67

13,716

288

0.0016

7.9971

1.615

2204

22

99.762

33.161

7.9922

2.11

7.8693
7.9970
7.997
7.9891

1.61
3.006
1.89
1.1810

94

2 ,2
2 × 128

4
5
6
7

Code Size

2 × 128 ,2256
264
256 bits
2 × 128 ,2256

23,464
1574
1407
4094

14.7
18
18.2
16

0.0778
99.868
99.598
99.582

109

0.0093
33.106
33.550
31.1101

0.0012
0.0034
0.0022
0.9677
0.0012
F. Thabit, S. Alhomdy and S. Jagtap

Global Transitions Proceedings 2 (2021) 100–110

communication reliability, these encryption algorithms play an important role where

the times for encoding and decoding and memory usage
are important issues of concern. The newly present Algorithm is a candidate for
security solutions in cloud services. In this article, the NLCA
(128 and 256 bit) structures are applied on the “MATLAB ○R platform”,
and the several basic image and text data tests are executed. The experiment
results indicate the performs of NLCA well in the Computational
time parameters and randomness and in the NLCA security analysis results
significantly less memory is taken. The Avalanche Test also shows
that, with a (single bit) shift in key or original text, the NLCA algorithm
will cause a large number of bits to change. Also, the result of Image
Entropy and Image Histogram shows that it is evident that the proposed
method NLCA is the most appropriate choice for image encryption.
Additionally, in this article study performance evaluation of propose
algorithm and symmetric cryptographic algorithms like (“AES”, “DES”,
“3DES”, “HIGH”, “RC4”, “SIT”, “SF’ and “SEA” It was done based on the
encryption-decryption and memory usage, Avalanche analysis, Differential
Cryptanalysis, Key-space analysis, Through the study, it was observed that NLCA
will be most reliable among whole algorithms in terms
of security, flexibility, usage and memory performance. After the comprehensive
examination under the strict criteria of performance evaluation, concluded that
NLCA-128 performs exceptionally well. In the near
future, we are interested in the detailed review evaluation performance
and cryptanalysis of this algorithm on different software and hardware
platforms for possible attacks.

[7] N. Gonzalez, et al., A quantitative analysis of current security concerns and

solutions
for cloud computing, J. Cloud Comput. (2012), doi:10.1186/2192-113X-1-11.
[8] R. Arora, A. Parashar, Secure user data in cloud computing using encryption
algorithms, Int. J. Eng. Res. Appl. (2013).
[9] D. Zissis, D. Lekkas, Addressing cloud computing security issues, Futur. Gener.
Comput. Syst. (2012), doi:10.1016/j.future.2010.12.006.
[10] M. Kantarciǒlu and C. Clifton, “Security issues in querying encrypted data,”
2005,
doi: 10.1007/11535706_24.
[11] S.K. Sood, A combined approach to ensure data security in cloud computing, J.
Netw.
Comput. Appl. (2012), doi:10.1016/j.jnca.2012.07.007.
[12] S.A.P.S.I.G.P.C.I.S.S. Council, PCI data security standard (PCI DSS),
https://www.pcisecuritystandards.org/documents/PCI_DSS_V1.0_Best_Practices_for_
Implementing_Security_Awareness_Program.pdf, 2014.
[13] N. Santos, K.P. Gummadi, and R. Rodrigues, “Towards trusted cloud computing,”
2009.
[14] J.M.A. Calero, N. Edwards, J. Kirschnick, L. Wilcock, M. Wray, Toward a
multi-tenancy authorization system for cloud services, IEEE Secur. Priv. (2010),
doi:10.1109/MSP.2010.194.
[15] J. Feng, Y. Chen, W.S. Ku, and P. Liu, “Analysis of integrity vulnerabilities
and a non-repudiation protocol for cloud data storage platforms,” 2010, doi:
10.1109/ICPPW.2010.42.
[16] Q. Zhang, L. Cheng, R. Boutaba, Cloud computing: state-of-the-art and research
challenges, J. Internet Serv. Appl. (2010), doi:10.1007/s13174-010-0007-6.
[17] J. Thakur, N. Kumar, DES, AES and blowfish: symmetric key cryptography
algorithms simulation based performance analysis, Int. J. Emerg. Technol. Adv. Eng.
(2011).
[18] T. Nie and T. Zhang, “A study of DES and blowfish encryption algorithm,” 2009,
doi: 10.1109/TENCON.2009.5396115.
[19] S. Manku, K. Vasanth, Blowfish encryption algorithm for information security,
ARPN
J. Eng. Appl. Sci. (2015).
[20] E. Islam, S. Azad, Data encryption standard, Pract. Cryptogr. (2014).
[21] P. Jindal and B. Singh, “RC4 encryption - a literature survey,” 2015, doi:
10.1016/j.procs.2015.02.129.
[22] B. Gastermann, M. Stopper, A. Kossik, and B. Katalinic, “Secure implementation
of
an on-premises cloud storage service for small and medium-sized enterprises,” 2015,
doi: 10.1016/j.proeng.2015.01.407.
[23] K.N. Pushpalatha, Design and Implementation of hybrid cryptosystem using AES
and
hash function, IOSR J. Electron. Commun. Eng. Ver. II (2015).
[24] M. Meenakumari, G. Athisha, Improving message authentication by integrating
encryption with hash function and its VLSI implementation, Int. J. Innov. Res.
Electr.
Electron. Instrum. Control Eng. (2014).
[25] M. Panda, “Performance analysis of encryption algorithms for security,” 2017,
doi:
10.1109/SCOPES.2016.7955835.
[26] S.S. Khan, P.R. Tuteja, Security in cloud computing using cryptographic
algorithms, Int. J. Innov. Res. Comput. Commun. Eng. (2015),
doi:10.15680/ijircce.2015.0301035.
[27] Z. Gong, S. Nikova, and Y.W. Law, “KLEIN: a new family of lightweight block
ciphers,” 2012, doi: 10.1007/978-3-642-25286-0_1.
[28] G. Leander, C. Paar, A. Poschmann, and K. Schramm, “New lightweight des
variants,”
2007, doi: 10.1007/978-3-540-74619-5_13.
[29] P. Princy, a Comparison of symmetric key algorithms des, aes, blowfish, Int. J.
Comput. Sci. Eng. Technol. (2015).
[30] P. Barreto, V. Rijmen, The Khazad legacy-level block cipher, NESSIE Work
(2000)
15 no. May.
[31] A. Kumar, Effective implementation and avalanche effect of AES, Int. J. Secur.
Priv.
Trust Manag. (2012), doi:10.5121/ijsptm.2012.1303.
[32] S. Shivkumar and G. Umamaheswari, “Performance comparison of advanced
encryption standard (AES) and AES key dependent S-box - simulation using MATLAB,”
2011, doi: 10.1109/PACC.2011.5979007.
[33] H.V. Gamido, A.M. Sison, R.P. Medina, Modified AES for text and image
encryption,
Indones. J. Electr. Eng. Comput. Sci. (2018), doi:10.11591/ijeecs.v11.i3.pp942-948.
[34] D.S. Abd Elminaam, H.M.A. Kader, M.M. Hadhoud, Evaluating the performance of
symmetric encryption algorithms, Int. J. Netw. Secur. (2010).
[35] X.J. Tong, Design of an image encryption scheme based on a multiple chaotic
map,
Commun. Nonlinear Sci. Numer. Simul. (2013), doi:10.1016/j.cnsns.2012.11.002.
[36] A.K. Mandal, C. Parakash, A. Tiwari, Performance evaluation of cryptographic
algorithms: des and AES,” 2012 IEEE Students’ Conf, Electr. Electron. Comput. Sci.
Innov.
Humanit. SCEECS (2012) 2012, doi:10.1109/SCEECS.2012.6184991.

Declaration of Competing Interest

The authors declare that they have no known competing financial
interests or personal relationships that could have appeared to influence
the work reported in this paper.
Acknowledgements
This research was partially supported by the Ministry of Higher Education - Yemen.
In addition, the authors would like to thank the anonymous reviewers for their
comments and suggestions for improving the
quality of this manuscript. Also, I need to thank my guide to Prof. Dr.
Sudhir B. Jagtap. For his guidance to my work.
References
[1] S.B.J. Fursan Thabit, Alhomdy, “a new lightweight cryptographic algorithm for
enhancing data security in cloud, Glob. Transitions Proc. (2021) 14–23.
[2] R.R. Bhandari, N. Mishra, Cloud computing acrmservice based on separate
encryption and decryption using blowfish algorithm, IJRITCC (2013).
[3] G.S. Pavithra, N.V. Babu, Energy efficient hierarchical clustering using HACOPSO
in
wireless sensor networks, Int. J. Innov. Technol. Explor. Eng. 8 (12) (2019).
[4] B.D. Parameshachari, H.T. Panduranga, S. liberata Ullo, September. Analysis and
computation of encryption technique to enhance security of medical images, IOP
Conf. Ser. 925 (1) (2020) 012028 IOP Publishing.
[5] B.D. Parameshachari, R.P. Kiran, P. Rashmi, M.C. Supriya, Rajashekarappa,
H.T. Panduranga, Controlled partial image encryption based on LSIC and chaotic
map, in: ICCSP, 2019, pp. 60–63.
[6] Advances in Security in Computing and Communications, 2017.

110