0% found this document useful (0 votes)
126 views9 pages

Performance Evaluation of Non-Latin Characters Based (Arabic) Symmetric Encryption Algorithm

Cryptography is the art of keeping information secure by transforming it into form that unintended recipients cannot understand. Encryption is a form of data security in which information is converted to cipher text to ensure confidentiality, authentication and integrity of user data. Issue relating to the choice of encryption algorithm among the Arabian IT community is another challenge.
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)
126 views9 pages

Performance Evaluation of Non-Latin Characters Based (Arabic) Symmetric Encryption Algorithm

Cryptography is the art of keeping information secure by transforming it into form that unintended recipients cannot understand. Encryption is a form of data security in which information is converted to cipher text to ensure confidentiality, authentication and integrity of user data. Issue relating to the choice of encryption algorithm among the Arabian IT community is another challenge.
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/ 9

Volume 9, Issue 1, January 2024 International Journal of Innovative Science and Research Technology

ISSN No:-2456-2165

Performance Evaluation of Non-Latin Characters


Based (Arabic) Symmetric Encryption Algorithm
1
Adebayo Ademola Riliwan; 2Oluokun Samuel Gbenga, 3Ogunode Rotimi Samuel, 4Seyi Osunade

Abstract:- Cryptography is the art of keeping uses a single key for encryption and decryption. The
information secure by transforming it into form that Symmetric encryption techniques provide cost-effective and
unintended recipients cannot understand. Encryption is efficient methods of securing data without compromising
a form of data security in which information is converted security however; sharing the secret key is a problem. On
to cipher text to ensure confidentiality, authentication the other hand, asymmetric techniques solve the problem of
and integrity of user data. Issue relating to the choice of distributing the key for encryption, but; they are slow
encryption algorithm among the Arabian IT community compared to symmetric encryption and consume more
is another challenge. This research evaluated the computer resources.
performance of three symmetric non-Latin character-
based encryption algorithms for Arabic text: First- In networking, security depends solely on
Order-Equation-of-Three-Variables, Modulo-37-cipher, cryptography (meaning “secret writing”), which is the
and Atbash-Substitution. The algorithms were assessed science and art of transforming messages to make them safe
based on the following performance metrics namely: and immune to attack (Hamouda, 2020).Cryptography is
encryption time, decryption time, execution time, said to be an Arab-born science that is improved by western
throughput, memory usage, and avalanche effect. The scientists (Al-Omari, 2018). A great historian in cryptology,
results revealed that the Atbash-Substitution algorithm David Khan stated that “cryptology was born in Arabic
had the highest throughput at 35.63 B/ms and the lowest world”and the fact was later confirmed in some Arabic
memory usage at 197.90 MB. It also exhibited a weak treatise found in Istanbul’s Suleymanye library in addition to
avalanche effect. In contrast, the Modulo-37-cipher the work of other scholars who wrote about cryptography
algorithm showed poor performance in terms of and cryptanalysis in the Arab world (Al-Omari, 2018).
throughput. Therefore, the Atbash-Substitution
algorithm demonstrated superior performance for Data that can be perused and perceived with no
Arabic text, being the fastest and most memory-efficient difficulty or special measures is called plain text. The
among the evaluated algorithms. method of changing plaintext and making it meaningless is
called encryption. The encryption process produces
Keyword:- Cipher, non-latin, throughput, encryption, unreadable and meaningless output called cipher-text. The
algorithms, modulo-37-cipher. process of retrieving plain text from cipher text is known as
decryption (Kuppuswamy and Alqahtani, 2014).
I. INTRODUCTION
Therefore, this paper aimed at comparing the three
As the Internet and other forms of electronic aforementioned algorithms which were evaluated based on
communication become more prevalent in the non-Latin the encryption and decryption time, throughput, memory
speaking countries/ groups, electronic security is becoming used and avalanche effects.
increasingly important (Al-Omari,2018). Thus, it becomes
essential to protect e-mail messages, credit card information, II. ALGORITHMS UNDER EVALUATION
and corporate data, by means of encryption that conform
with the Latin alphabets and numbers.Various cryptographic Modulo 37 Cipher Encryption Algorithm:
algorithms have been proposed and implemented to achieve Kuppuswamy and Alqahtani, (2014) developed an
the security requirements such as Authentication, encryption algorithm cipher that uses modulo 37 in its
Confidentiality, and Integrity of the Arabic language. There mathematical model. The algorithm provided an effective
are basically two types of encryption techniques; symmetric use of key algorithm on Arabic characters.
and asymmetric. Symmetric cryptography is the one which

The algorithm for key generation is as follows:


Step 1 – any natural number say n was selected
Step 2 – the inverse of n was calculated with modulo 37 (key 1) say k
Step 3 – select another random negative number say n1
Step 4 – the inverse of the n1 was calculated with modulo 37(key 2) say k1

The algorithm process for the encryption phase is as follows:


Step 1 – user ID in the synthetic table was assigned a value
Step 2 – the synthetic number was multiplied by any random selected natural number
Step 3 – calculation was done using modulo 37
Step 4 – random negative number was selected and multiplied with the result in step 3
Step 5 – calculation was done using modulo 37 {CT =(PT* n*n1)mod 37}

IJISRT24JAN410 www.ijisrt.com 566


Volume 9, Issue 1, January 2024 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165

The algorithm process for the decryption phase is Step 2 – calculation was done using modulo 37
as follows; Step 3 – Result of the calculation produce ‘R’
Step 1 – encrypted text was multiplied by key1 and
key2

Fig. 1: Modulo 37 Cipher Encryption and Decryption Architecture (Kuppuswamy and Alqahtani, 2014)

 First Order Equation of Three variables Encryption generate key. The algorithm technique makes use of
Algorithm: Shaban (2017) in his work proposed the different equation in the key generation mechanism and
algorithm where two random numbers are used to encryption mechanism.

The algorithm process for the key generation phase is as follows:


Step 1 – a first order equation of three variables is chosen say 2x+y-3z, where x represents the character of the message and y,
z are two random numbers
Step 2 – a random number say key1 is chosen and it is assigned to y
Step 3 – another random number say key2 is chosen and it is assigned to z
Step 4 – the chosen equation and the two random numbers selected are only known by the sender and receiver

The algorithm process for the encryption phase is as follows:


Step 1 – the equation values is computed for each Arabic character in the plain text
Step 2 – the character obtained is converted to the binary format

Step 3 – the XOR of key1 and the odd position characters is computed; same as the XOR of key2 and the character in the
even position computed
Step 5 – All messages are later converted to the binary format transmitted to the receiver over the internet

IJISRT24JAN410 www.ijisrt.com 567


Volume 9, Issue 1, January 2024 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165

Fig. 2: First Order Equation of Three variables Encryption Phase (Basim, 2017)

The algorithm process for the decryption phase is as follows:


Step 1 – the same key1 and key2 are used to decrypt the message
Step 2 – XOR between key1 and the character in the odd position and key2 with the character in the even position is
computed
Step 3 – the binary format is converted to the numeric value for each message characters
Step 4 – the inverse of the first order equation is calculated to find the value of each character in the message such as x=(3z-
y)/2; where the value of the x represent the character that we want to decrypt and y represent key1 and z represent key2
Step 5 – lastly, we converted the binary format of the message to character format

Fig. 3: First Order Equation of Three variables Decryption Phase (Basim, 2016)

IJISRT24JAN410 www.ijisrt.com 568


Volume 9, Issue 1, January 2024 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165
III. IMPLEMENTATION not all of them are reliable for every kind of data to be
ciphered.
This study implemented the algorithms in
phpprograming language. The authors built on existing php That is why this study embarks on testing three recent
extension for the implementation of the algorithms under encryption algorithms for Arabic text to determine which
evaluation. The text files used were between 94B to 980B, one is best suitable and at what time. Due to the fact that
which consisting of only Arabic text as input for encryption. three of these encryption algorithms will be implemented to
The encrypted output of each text is copied, which in turn is achieve the aim of the paper, it is important to note that the
input for decryption. For the sake of comparison the study work does not primarily focus on the development of the
used the same input textof the same size for all algorithms encryption algorithms, but on the resource utilization of this
throughout the experiment. Also the study used the same algorithm to determine if they are suitable for the task at
system for all implementations and analysis work, so that which they are implemented on.
memory and processor conditions remain same for all
algorithms for comparison. All block cipher algorithms are Each of the three algorithms will be implemented
set in a same mode which is MCRYPT_MODE_CBC. CBC solely for the testing of their encryption and decryption
stands for Cipher Block Chaining.It works by XORing each strengths, weaknesses as well as the resources they make use
plaintext block of text against the plaintext block preceding of during the process.
it, then encrypting it, this makes duplicate plaintext blocks
different when encrypted. Each of the encryption techniques has its own strong
and weak points. In order to apply a suitable cryptography
IV. SYSTEM PARAMETERS algorithm to an application, we should have knowledge
regarding performance, strength and weakness of the
The experiment are conducted using Intel(R) algorithms. Therefore, these algorithms must be analysed
Core(TM) i7-3687U CPU @ 2.10GHz, 2601 Mhz, 2 based on several features. In this paper, analysis is done with
Core(s), 4 Logical Processor(s), 12GB RAM. The following metrics under which the cryptosystems can be
simulation program is compiled using the default settings in compared are described below:
.NET 2013 visual studio for C# windows applications. The  Encryption time (𝐸𝑡 ):This is the time taken to change
experiments was performed couple of times to ensure that original text (plain text) to scramble text (cipher text).It
the results are consistent and are valid to compare the is important that encryption processes of algorithms are
different algorithms. The value of the information is fast enough to meet real time requirements. Therefore,
proportional to the risk of information which means when the speed at which encryption takes place in each of the
high valued information there will be a great need for the case study algorithms will be determined. Encryption
information to be protected and secured. time is dependent on the key size, plaintext block size
and mode of encryption process. For this research,
Encryption algorithms consume a significant amount encryption time was measured in milliseconds.
of computing resources such as CPU time, memory and  Decryption time (𝐷𝑡 ): this is the time expended in the
computation time (Mandal, 2012). Determining the process of retrieving original text (plain text) from
appropriate algorithm suited for a particular data type, and scrambled text (ciphertext). it is desired for the
scenario there is need to answer the following questions and decryption time to be lesser so as to improve system
possibly problems; responsiveness. Decryption time impacts performance of
 To determine time taken by an algorithm to processes a system. Forthis research, decryption time was measured
file during encryption and decryption. in milliseconds.
 To estimate the amount of CPU time consumed in the  Throughput (𝑇𝑝 ): The throughput of the encryption
process. scheme is the size ofthe plain text in bytes divided by the
 To Calculate the Memory Utilized. encryption time in millisecond. It was defined as the
measure of the data-transfer rate through a networking
This study is based on the design of a benchmark
scheme. Throughput is considered an indication of the
application using php program for testing the selected
overall performance of the system. Throughput can be
encryption algorithms (Modulo 37 Cipher Encryption
calculated using equation 1.
Algorithm, First Order Equation of Three variables
Encryption Algorithm and Atbash Substitution) in order to 𝑃
𝑇𝑝 = 𝐸𝑡 (1)
evaluate the resource utilization and time consumed by each 𝑡
algorithm with different Arabic input data size to determine
the most appropriate algorithm for Arabic text. Various Where; 𝑃𝑇𝑠 : 𝐷𝑎𝑡𝑎 𝑆𝑖𝑧𝑒;
encryption algorithms have been developed in time past for
various purposes. They all have their strengths for 𝑇𝑝 : 𝑇ℎ𝑟𝑜𝑢𝑔ℎ𝑝𝑢𝑡; 𝐸𝑡 : 𝐸𝑛𝑐𝑟𝑦𝑝𝑡𝑖𝑜𝑛 𝑇𝑖𝑚𝑒
encryption and decryption but they also have their
weaknesses in times of attack (i.e unauthorized person(s)  Execution Time (𝑬𝑿𝒕 ): This refers to the total time
attempting to decipher encrypted data in a forceful manner expended in converting the original text (plain text) to
without the appropriate decryption keys). Encryption scrambled text (cipher text) i.e. encryption time and the
algorithms are said to have improved from time to time but time to retrieve original text (plain text) from scrambled
text (cipher text) i.e.decryption time. Execution time can
be calculated using equation 2.

IJISRT24JAN410 www.ijisrt.com 569


Volume 9, Issue 1, January 2024 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165
𝐸𝑋𝑡 = 𝐸𝑡 + 𝐷𝑡 (2)  Avalanche Effect (𝑨𝑬 ): This is the diffusion reflects of
the cryptographic strength of an algorithm. It shows the
Where; 𝐸𝑋𝑡 : 𝐸𝑥𝑒𝑐𝑢𝑡𝑖𝑜𝑛 𝑇𝑖𝑚𝑒; significant of changes made to an input (plain text) to
𝐸𝑡 : 𝐸𝑛𝑐𝑟𝑦𝑝𝑡𝑖𝑜𝑛 𝑇𝑖𝑚𝑒; produce an output (cipher text). This wasachieved by
𝐷𝑡 : 𝐷𝑒𝑐𝑟𝑦𝑝𝑡𝑖𝑜𝑛 𝑇𝑖𝑚𝑒 measuring the level of dissimilarity (Hamming distance).
We calculate the Hamming distance as a sum of bit by
 Memory Used: The memory requirement is dependent bitxor considering the ascii value, as it becomes easy to
on the number of operations to be performed by the implement programmatically. Avalanche effect reflects
algorithm, key size used, initialization vectors and the performance of cryptographic algorithm.
type of operations. It is desirable that the memory
required should be as small as possible because it greatly 𝐴𝐸 = (hamming distance ÷ file size) (3)
has cost implication on the system to be used.

V. SIMULATION PROCEDURE MODEL DESIGN

Fig. 4: Simulation Procedure Model Diagram

For clarification, simplicity and a better understanding The model would be able to perform encryption and
of the application,figure 4 shows the modules involved the decryption of non-Latin character based (Arabic). It is
evaluation processes. assumed the computer system involved in the model runs
 The first module (data module), specified the data to be Microsoft Windows operating system because this is a
encrypted or decrypted using different algorithms. The platform where the developed system will perform
data accepted by this module is the Arabic text. optimally.The evaluation system was developed using PHP
 The second module (algorithm module), involved the because it is a general-purpose language endowed with
selection of any of the implemented algorithm to be used numerous implementations. The choice of the language is
for encryption and decryption of the data specified in the made due to its excellent flexibility, combinability and the
data module. availability of specialist writing the language.
 The third module (report module), displayed the
resulting report of encryption and decryption process VI. RESULT AND DISCUSSION
based on the selected performance metrics. The report From the data recorded for ten (10) different Arabic
will include result of the encryption, the data size, the texts that are of different size, the evaluation of the
encryption parameters, and memory usage. All these following metrics was deduced and represented with tables
parameters will be displayed for each algorithm that was and charts.
executed independently of the others (i.e. every
 Encryption Time: As shown in table 1 and represented
algorithm will be executed one after the other so that
in figure 5, On average, Atbash substitution has
each can have full system resources at its disposal). The
12.66ms, Modulo-37-cipher 19.07ms while first order
result of this module is the key to determining the most
equation of three variables 21.79ms. Also, the encryption
secure and appropriate encryption algorithm for each
time increases with increase in the input data size.
data type, size and scenario.
Encryption time is directly proportional to the input data
size.

IJISRT24JAN410 www.ijisrt.com 570


Volume 9, Issue 1, January 2024 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165
Table 1: Encryption Time Comparison for Selected Arabic Encryption Algorithms
ENRYPTION TIME (ms)
980 742 726 456 430 426 316 260 116 94 Avearge
bytes bytes bytes bytes bytes bytes bytes bytes bytes bytes Time
First Order Equation 47.29 38.39 34.29 21.42 20.31 20.02 14.74 11.78 5.22 4.43 21.79
of Three Variables
Modulo 37 Cipher 40.48 31.94 29.74 19.3 18.20 18.03 13.19 11.00 4.91 3.87 19.07
Atbash Substitution 27.75 21.01 18.56 12.62 12.18 12.07 8.92 7.39 3.29 2.77 12.66

Fig. 5: Encryption Time Comparison for Selected Arabic Encryption Algorithms

 Decryption Time: As shown in table 2 and illustrated in substitution has 12.66ms. Also, the decryption time
figure 6,modulo-37-cipher has 12.79ms, first order increases with increase in the input data size. Encryption
equation of three variables 13.01ms and Atbash time is directly proportional to the input data size.

Table 2: Decryption Time Comparison for Selected Arabic Encryption Algorithms


DECRYPTION TIME (ms)
980 742 726 456 430 426 316 260 116 94 Average
bytes bytes bytes bytes bytes bytes bytes bytes bytes bytes
First Order 28.00 21.82 20.59 13.49 12.29 12.14 9.01 7.52 3.37 2.78 13.10
Equation of
Three Variables
Modulo 37 27.69 20.97 20.51 12.93 12.15 12.04 8.86 7.01 3.31 2.46 12.79
Cipher
Atbash 46.32 35.04 32.16 20.81 20.26 20.12 14.97 12.15 5.56 4.29 21.17
Substitution

IJISRT24JAN410 www.ijisrt.com 571


Volume 9, Issue 1, January 2024 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165

Fig. 6: Decryption Time Comparison for Selected Arabic Encryption Algorithms

 Execution Time (𝑬𝑿𝒕 ): As shown in table 3 and Atbash substitution 33.82ms and first order equation of
illustrated in figure 7, modulo-37-cipher has 31.86ms, three variables 34.89ms.

Table 3: Execution Time Comparison for Selected Arabic Encryption Algorithms


EXECUTION TIME (ms)
980 742 726 456 430 426 316 260 116 94 Average
bytes bytes bytes bytes bytes bytes bytes bytes bytes bytes
First Order 75.29 60.21 54.88 34.91 32.60 32.17 23.75 19.30 8.59 7.21 34.89
Equation of
Three Variables
Modulo 37 68.17 52.91 50.25 32.23 30.35 30.07 22.05 18.01 8.22 6.33 31.86
Cipher
Atbash 74.07 56.05 50.72 33.43 32.44 32.18 23.89 19.54 8.85 7.06 33.82
Substitution

Fig. 7: Execution Time Comparison for Selected Arabic Encryption Algorithms

 Throughput (𝑻𝒑 ):Table 4 and figure 8 shows the has 35.63b/ms, modulo-37-cipher 23.83b/ms, and first
throughput for the selected encryption algorithm for non- order equation of three variables 21.19b/ms.
Latin character (Arabic), on average, Atbash substitution

IJISRT24JAN410 www.ijisrt.com 572


Volume 9, Issue 1, January 2024 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165
Table 4: Throughput Comparison for Selected Arabic Encryption Algorithms
THROUGHPUT (B/ms)
980 742 726 456 430 426 316 260 116 94 Average
bytes bytes bytes bytes bytes bytes bytes bytes bytes bytes
First Order 20.72 19.32 21.17 21.29 21.17 21.29 21.44 22.07 22.22 21.22 21.19
Equation of
Three Variables
Modulo 37 24.21 23.23 24.41 23.62 23.63 23.63 23.96 23.63 23.63 24.29 23.82
Cipher
Atbash 35.31 35.31 39.11 36.13 35.30 35.29 35.43 35.18 35.26 33.94 35.63
Substitution

Fig. 8: Throughput Comparison for Selected Arabic Encryption Algorithms

 Memory Used: As shown in Table 5 and represented cipher 196.31 MB, and first order equation of three
with the chart in the figure 9, on average, it was deduced variables 197.04 MB.
that Atbash Substitution used 197.04 MB, modulo-37-

Table 5: Memory Usage Comparison for Selected Arabic Encryption Algorithms


MEMORY USAGE (MB)
980 742 726 456 430 426 316 260 116 94 Average
bytes bytes bytes bytes bytes bytes bytes bytes bytes bytes Memory
First Order 196.65 198.65 197.75 197.30 196.20 196.10 196.95 197.35 196.90 196.55 197.04
Equation of
Three Variables
Modulo 37 195.75 196.65 196.85 196.25 195.15 196.60 196.10 197.20 195.45 197.10 196.31
Cipher
Atbash 198.90 197.70 198.35 196.70 198.90 198.20 197.10 197.25 197.55 198.35 197.90
Substitution

IJISRT24JAN410 www.ijisrt.com 573


Volume 9, Issue 1, January 2024 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165

Fig. 9: Memory Usage Comparison for Selected Arabic Encryption Algorithms

 Avalanche Effect: This explains the diffusion reflects of uses low memory space. First Order Equation of Three
the cryptographic strength of each encryption algorithm. variables showed poor performance results compared to
It provides the significant changes made to an input other algorithms since it requires more memory and has
(plain text) to produce an output (cipher text). As shown poor throughput.
in the decryption GUI of each of the encryption
algorithm, it is deduced that Atbash substitution has REFERENCES
weak avalanche effect in that the number of bits of the
[1]. Ahmad, S., Alam, K. M. R., Rahman, H., and Tamura,
input plain text produce the same number of bits of the
S. (2015, January). A comparison between symmetric
output cipher text while others have strong avalanche
and asymmetric key encryption algorithm based
effect.
decryption mixnets. International Conference on
VII. CONCLUSION Networking Systems and Security (NSysS) (pp. 1-5).
IEEE.
Cryptography is the art of keeping information secure [2]. Al-Omari, A. H. (2018). ABJAD Arabic-Based
by transforming it into form that unintended recipients Encryption. International Journal of Advanced
cannot understand. Encryption is a form of data security in Computer Science and Applications, 9(10).
which information is converted to cipher text to ensure [3]. Altamimi, A. S. H., &Kaittan, A. M. (2021). A
confidentiality, authentication, integrity, availability and Proposed Arabic Text Encryption Method Using
identification of user data. Issues relating to the choice of Multiple Ciphers. Management.
encryption algorithm take into consideration the block size, [4]. Elminaam, D. S. A., Kader, H. M. A., &Hadhoud, M.
CPU resources usage and time for encryption/decryption M. (2008). Performance evaluation of symmetric
process are another challenge in the IT community among encryption algorithms. IJCSNS International Journal
the Arabian text users. Hence, this research was a of Computer Science and Network Security, 8(12), 280-
performance evaluation of non-Latin character-based 286.
encryption algorithm. [5]. Hamouda, B. E. H. H. (2020). Comparative study of
different cryptographic algorithms. Journal of
The result obtained by the application is exported to Information Security, 11(3), 138-148.
Microsoft excel for further analysis. The result support that [6]. Kuppuswamy, P., &Alqahtani, Y. (2014). New
the throughput of any encryption algorithm is inversely innovation of Arabic language encryption technique
proportional to the period of the encryption process. In terms using new symmetric key algorithm. International
of throughput, Atbash substitution is the fastest, followed by Journal of Advances in Engineering & Technology,
First Order Equation of Three Variables and Modulo 37 7(1), 30.
Cipher. The encryption time is low in Atbash, followed by [7]. Masram, R., Shahare, V., Abraham, J., &Moona, R.
Modulo 37 Cipher and First Order Equation of Three (2014). Analysis and comparison of symmetric key
Variables. On memory usage, Atbash substitution required cryptographic algorithms based on various file
the least memory followed by Modulo 37 Cipher and First features. International Journal of Network Security &
Order Equation of Three Variables. Lastly, the avalanche Its Applications, 6(4), 43.
effect is strong in Modulo 37 Cipher and First Order [8]. Shaban, S. A. (2017). A new algorithm for encrypting
Equation of Three Variables while weak in Atbash Arabic text using the mathematical equation. Diyala
substitution. journal of engineering sciences, 10(1), 21-30.
[9]. Stallings, W. (2006). Cryptography and network
It was concluded that Atbash substitution has a better security principles and practices 4th edition.
performance for Arabic text than the other two algorithms
compared since it is the fastest in terms of throughput and

IJISRT24JAN410 www.ijisrt.com 574

You might also like