See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/348976913

Paper 2 -

Presentation · February 2021

CITATIONS READS

0 2

1 author:

Fursan Thabit
Swami Ramanand Teerth Marathwada University
8 PUBLICATIONS   1 CITATION   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

cloud computing security View project

All content following this page was uploaded by Fursan Thabit on 02 February 2021.

The user has requested enhancement of the downloaded file.

• In purely mathematical terms [5], cryptography is the ability of translating plain-text data (P) into
an unreadable cipher-text (C) format known encryption and using mathematics to convert the
cipher-text to a plain-text called decryption using keys (k1 and k2) for encryption with the set of
techniques called cryptographic algorithms (E) and the decryption algorithm (D) which overturns
and generates. This can be describe as
“Cipher-text C = E {P, Key}”
“Plain-text C = D {C, Key}”
Describing some terms used for Cryptography:
• Plain-text is the initial input or knowledge that is entered into algorithms from an intuitive source.
• Cipher-text is the output of the mixed message as a random flow of incomprehensible information
• Encryption Algorithm techniques for replaces and performs changes on plain -text to cipher text.
• Decryption Algorithm is method to run encryption in reverse by taking the encryption key and
transforming the cipher- text to produce plain text
• Keys are applied as input for encryption or decryption to prepare the transformation
• Senders and receivers are individuals who interact and exchange the plain-text.
The primary purpose of the use of cryptography is to conform to the following
basic requirements for information security:
 Confidentiality
 Integrity
 Availability
 Authorization
 Non-repudiations
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.
 Symmetric Algorithms
 Asymmetric Algorithms
 Hybrid Algorithms
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”[15].
DES is the early symmetric encryption
technique established by IBM in 1972 and
implemented by the “National Standard
Bureau (NBS) as the Federal Information
Processing Standard (FIPS) in 1977”. DES
is a symmetric key cryptographic algorithm
that is used for encrypting electronic data.
DES is a block cypher that uses 64 key bits,
but only 56 key bits are effective, and parity
is used for the rest of the bits. It is made up
of 16 round permutations and two original
and final permutations [17].In typical threat
environments, the 56-bit key size that
produces 7.2 * 1016 potential keys provides
power to DES.
3DES
“Triple Data Encryption Standard (3DES)”
that was firstly projected by IBM in 1998 and
standardized in ANSI X9.17 and ISO 8732.
The algorithm is based on the three main
options given by the Feistel structure. The key
length is 168 bits allowed in 16 sub keys that
contain 8 s blocks and are 48 bits in length. It
uses the same decryption algorithm” [17]
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” [16]. 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.
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 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[18].
Tiny Encryption Algorithm (TEA)

The Tiny Encryption Algorithm (TEA) has

fewer code lines, making it very simple to
build and execute. The method uses two 32-
bit unsigned number/code blocks can be
created from a 64-bit block and 128-bit-
length keys (k [0] - k [3]) to produce results
in form of w [0] and w [1].
Magicnumber/constant sets are used to avert
attacks dependent on round regularity [21].
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.
• NLCA The introduced algorithm [1] is a symmetric key block cipher and the idea is
inspired by a combination of Feistel and 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;
every round is based on mathematical functions to generate diffusion and
uncertainty. Cryptographic algorithms are usually configured to take 10 to 20 rounds
on average to keep the encryption process strong enough to satisfy the specifications
of the device. However, the suggested algorithm is limited to just five rounds to
further increase energy efficiency results, with each encryption round requiring
mathematical operations that involve 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
These detailed steps of the procedures are described as follows:
• Key Generation Block.
• Encryption Block.
• Decryption Block.
In the following subsections, these blocks will be further clarified in detail,
• Key Generation Block
The primary method used to produce various encryption and decryption keys is the key
generation block process. The most significant component in the methods encryption and
decryption is the key .If this key is identified to an attacker; the confidentiality of the data is
compromised. It is this key on which the whole integrity of the data rests.
• 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
• 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 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 well-known parameters used by various authors
[29],[30] [31], [32] and [33] to compare the efficiency of different traditional
algorithms. The evaluation parameters are as follows:

A. Avalanche Test
B. Visual Assessment
C. Correlation Analysis
D. Statistical Analysis
E. Time Complexity
F. Execution Time (Encryption time - Decryption time)
G. Image histogram
H. Image Entropy
• Avalanche Test
A very well-known parameter that is used to analyzed 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.
• 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.
• Visual Assessment
It must be achieved on an encrypted output. If an attacker has the potential to
deduce any significant information by visually analyzing the encrypted result, so
in the first stage itself, the scheme is said to be abortive.
• Statistical Analysis
This analysis is conducted to determine the uncertainty characteristics of encrypted
files. The relation between encrypted data and original data is seen by the
evaluation of correlation coefficients.
• Key-Space Analysis (Brute-Force Attack)
Encryption programmers can be particularly resilient to very subtle modifications
to the key used in the encryption process.
• Time Complexity
An attacker needs to locate 2128 potential keys with a key size of 128 bits.
Therefore, on average, the time complexity of 2128 complexity of finding the
right key is O (1).
• Execution time
One of the important parameters to be considered in the development of an
encryption algorithm, along with security, is the execution time
• Image histogram
The image histogram is a newly used parameter that indicates the randomness of
the distribution of encrypted image details.
• Image Entropy
Digital images, assembled to form a visual perception of images, are a mixture of
discrete valued pixels. The simplest parameter used to analyze the randomness of
the encrypted image is the image entropy index
Experimental Analysis Results
The experiments analysis is conducted on plain text as well as on image data. The
original and encrypted images for NLCA-128 are shown . The complete description of
the experiments and their outcomes are discussed below.
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 shows the experimental results of encryption
algorithms, and shows that all algorithms use the same text files for five experiments.
By analysing the table, NLCA is taking less encryption time, and RC4 is also taking less
time for encryption while as AES and the 3DES is taking more time for encryption and
the memory usage examination all algorithms in which, NLCA, IDEA, SIT, and TEA
are having significantly less memory usage while RC4 is taking the maximum memory
of all the algorithms.
No name Avalan Key Code RAM Differential Correl entrop Executi
che space Size Cryptanalysis ation y on time
analysi analysi NCPR UACI analysi analysi (s)
s s s s
1 SEA[35 - 1570 176 -- -- 0.0072 7.4436 2.67
] 248,294
2 HIGH[ - 2*128 13716 288 -- -- 0.0016 7.9971 1.615
36]

3 SF[36] 0.4570 2*64 2204 22 99.762 33.161 7.9922 2.11

0.0012
4 AES[22 0.3603 2*128,225 23464 14.7 0.0778 0.0093 0.0034 7.8693 1.61
] 6

5 SIT[37] 0.4830 264 1574 18 99.868 33.106 0.0022 7.9970 3.006

6 DES[34 0.6756 256 bits 1407 18.2 99.598 33.550 0.9677 7.997 1.89
]

7 NLCA 0.0363 2*128,225 4094 16 99.582 31.1101 0.0012 7.9891 1.1810

[1] 6
• With the development of advanced technologies in cloud computing, security remains one of the
most significant problems in the cloud computing world. Using security algorithms and ensuring that
these algorithms are correctly and reliably applied to protect the safety of end-users. In
communication reliability, these encryption algorithms play an important role, where encryption-
decryption time and memory utilisation are significant issues of concern. The newly proposed
algorithm is one of the candidates for Security solutions in cloud services. In this article, the NLCA
(128 and 256 bit) structures are applied on the "MATLAB ® 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.
View publication stats