International Journal of Trend in Scientific Research and Development (IJTSRD)

Volume 3 Issue 5, August 2019 Available Online: www.ijtsrd.com e-ISSN: 2456 – 6470

Performance Analysis of Data Encryption Standard (DES)

Thida Soe, Soe Soe Mon, Khin Aye Thu
Faculty of computer systems and Technology, University of Computer Studies, Hinthada, Myanmar

How to cite this paper: Thida Soe | Soe ABSTRACT

Soe Mon | Khin Aye Thu "Performance Information security is becoming much more important in data storage and
Analysis of Data Encryption Standard transmission with the fast progression of digital data exchange in electronic
(DES)" Published in way. Cryptography has come up as a solution which plays a vital role in
International information security system against malicious attacks. The cryptography is
Journal of Trend in most important aspect of communications security and becoming an
Scientific Research important building block for computer security. This security mechanism uses
and Development some algorithms to scramble data into unreadable text which can be only
(ijtsrd), ISSN: 2456- being decoded or decrypted by party those possesses the associated key. To
6470, Volume-3 | IJTSRD26650 protect sent messages that some of the most commonly used cryptography
Issue-5, August methods with private key based algorithm are LOKI (89, 91, 97), DES, triple
2019, pp.1439-1443, DES, AES, Blowfish, etc. These algorithms also include several computational
https://doi.org/10.31142/ijtsrd26650 issues as well as the analysis of DES algorithm. The main features that specify
and differentiate one algorithm from another are the ability to the speed of
Copyright © 2019 by author(s) and encryption and decryption of the input plain text. This paper analyzes the
International Journal of Trend in Scientific private key based algorithm DES and LOKI91 by computing index of
Research and Development Journal. This coincidence (IC) and time efficiency.
is an Open Access article distributed
under the terms of KEYWORDS: cryptography, DES, LOKI91, Index of Coincidence (IC), run time
the Creative INTRODUCTION
Commons Attribution Cryptography algorithms play an important role in providing security to
License (CC BY 4.0) networks. They can be categorized into symmetric (private) and asymmetric
(http://creativecommons.org/licenses/by (public) keys encryption.
/4.0)
In asymmetric keys, two keys are used; private and public and swapping. DES consists of 16 rounds and each round
keys. Public key is used for encryption and private key is used only one round key that keys are generated from the
used for decryption. In symmetric keys encryption or secret round key generator. Round key generator crates the 48 bit
key encryption, only one key is used to encrypt and decrypt keys for each round.
data. Symmetric algorithms can be divided into two
 DES Algorithm
categories: block ciphers and stream ciphers. The block
ciphers operate on data in groups or blocks. The most
common secure algorithms are DESX, a variation of Data
Encryption Standard (DES), Blowfish and Advanced
Encryption Standard (AES), etc. The less common secure
algorithms are IDEA, RC6, LOKI (89/91/97), etc.
For each algorithm there are two key aspects used:
Algorithm type (define size of plain text should be encrypted
per step) and algorithm mode (define cryptographic
Algorithm mode). Algorithm mode is a combination of a
series of the basic algorithm and some block cipher and
some feedback from previous steps. LOKI uses one 64-bit
keys, DESX uses one 128-bit key while AES uses various 128,
192 or 256 bit keys. Blowfish uses various 32-448 default
128 bits. Encryption algorithms consume significant amount
of computing resources such as CPU time, battery power etc.
We compare and analyzed algorithms DES and LOKI91.
A. Data Encryption Standard (DES)
DES is a block cipher. It encrypts the plaintext data in a block
of 64 bits and produces 64 bit cipher text. The cipher key
length is 56 bits and round key length is 48 bits. Initially the
key is consisting of 64 bits with the parity bits 8, 16, 24,
32,40,48,56, 64 and that bits are used for parity checking
and is ignored. DES is based on the fundamental attributes of
cryptographic functions such as substitution (confusion) and
transposition (diffusion), exclusive-OR operation, shifting Fig.1 Schematic DES algorithm

@ IJTSRD | Unique Paper ID – IJTSRD26650 | Volume – 3 | Issue – 5 | July - August 2019 Page 1439
 International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470
The algorithms steps are as follow: were designed to "mix" the outputs of the S-boxes as quickly
1. In the first step, the initial 64-bit
bit plain text block is as possible, promoting the avalanche and completeness
handed over to initial permutation (IP) function. properties, essential for a good Feistel cipher. However
2. The initial permutation is performed on plain text. unlike their equivalents in the DES, they are intended to be
3. The initial permutation produces two halves of as clean and simple as possible, aiding the analysis of the
permuted block: Left plain text (L0) and Right pl
plain text design.
(R0).
4. Each of L0 and R0 goes through 16 rounds of the Following the publication of LOKI89,
LOKI89 information on the
encryption process, each with its own key. new differential cryptanalysis became available. This
resulted in the design being changed to become LOKI91.
The single round of DES is shown in Fig. 2. These steps are
A. From the 56-bit bit key, a different 4848-bit sub-key is
 LOKI91
generated by using key transformation. n.
LOKI91 was designed in response to the attacks on LOKI89.
B. Using the expansion permutation, the R0 is expended
The changes included removing the initial and final key
from 32 bits to 48 bits.
whitening, a new S-box,
box, and small alterations to the key
C. Now, the 48-bitbit key is XORed with 4848-bit Ki and the
schedule.. More specifically, the S-boxes
S were changed to
resulting output is given in the next
minimize the probability of seeing different inputs resulting
D. step.
in the same output (a hook which Differential
E. Using the S-box
box substitution produce the 32
32-bit from 48-
cryptanalysis uses), thus improving LOKI91's immunity to
bit input.
this attack. The changes to the key schedule were designed
F. These 32 bits its are permuted using straight P P-box
to reduce the number of "equivalent" or "related" keys,
permutation.
which resulted inn the exhaustive search space for the cipher
G. The straight P-box
box output 32 bits are XORed with the
being reduced.
L032 bits.
H. The result of the XORed 32 bits becomes the R1 and old
Whilst the resulting cipher is clearly stronger and more
R0 become the L1. This process is called as swapping.
secure than LOKI89, there are a number of potential attacks.
Now the R1 again given to the next round and performed
Consequently these ciphers should be viewed as academic
the 15 more rounds.
efforts to advance the field of block cipher design, rather
5. After the completion of 16 rounds, the final permutation than algorithms for use. The number of citations and
is performed. published critiques suggests this aim has been achieved.

 LOKI91 Algorithm

Fig.2 Single Round of DES

B. LOKI
In cryptography, LOKI89 and LOKI91 are symmetric
symmetric-
key block ciphers designed as possible replacement
replacements for Fig.3 Schematic LOKI91 algorithm
the Data Encryption Standard (DES). The ciphers were
developed based on a body of work analyzing DES, and are The mechanics of LOKI91 are similar to DES. The data block
very similar to DES in structure. The LOKI algorithms were then divided into a left half and right half and goes through
named for Loki. 16 rounds, much like DES. In each round, the right half is
first XORed with a piece of the key, then through an
 LOKI89 expansion permutation.
The cipher uses a 64-bit block and a 64-bit key
key. Like DES, it is
The 48 bit output is divided into four 12-bit
12 blocks, and each
a 16-round Feistel cipher and has a similar general structure,
block is sent through an S-box
box substitution. Then, the four 8-
8
but differs in the choice of the particular S-boxes, the
bits output are recombined to form a single 32-bit
32 number
"straight P-permutation",
permutation", and the "Expansion permutation".
and sent through the permutation. Finally, the right half is
The S-Boxes use the non-linearity
linearity criteria developed by Josef
XORed with the left half to become the new right half, and
Pieprzyk, making them as "complex" and "unpredictable" as
the right half becomes the new left half. After 16 rounds, the
possible. Their effectiveness was compared against the
block is again XORed with the key to produce the ciphertext.
known design criteria for the DES S-boxes.. The permutations

@ IJTSRD | Unique Paper ID – IJTSRD26650

26650 | Volume – 3 | Issue – 5 | July - August 2019 Page 1440
 International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470
The sub-keys are generated from the key in a straight 2. Convert the key from ASCII to binary from, and then
forward manner. The 64-bit key is split into a left half and a obtain 64-bits input.
right half. This left half is then rotated 12 or 13 bits to the left 3. Change the first 32 bits position by using the first of
and then every two rounds the left and right halves are permuted choice (PC-1). Then we obtain Ci 32 bits and
exchanged. As with DES, the same algorithm can be used for the last 32 bits for the second part, so we get Di 32 bits.
both encryption and decryption, with some modification in 4. After the first round, the rotation of the left sub-key
how the sub-keys are used. alternated between 12 and 13 bits to the left. Then every
two round, the left and right halves are exchanged.
C. Analysis of DES and LOKI91 Algorithms
 Implementation of DES Algorithm 5. After repeating tis operation 16 times, we get 16
number of Ki.
The procedures of encryption program are as follow: 6. Read the input file name and the output file name the
1. Read a key of any 8 characters. operation.
2. Convert the key from ASCII to binary from, and then 7. If end of encounter, the process will stop.
obtain 64-bits input. 8. Read the 8 characters from input files and convert the
3. Change the first 28 bits position by using the first of ASCII code to binary for, so we obtain the 64 bits input.
permuted choice (PC-1). Then we obtain Ci 28 bits and Then change position by using initial permutation (IP).
the last 28 bits for the second part, so we get Di 28 bits. 9. The left 32 bits is called left permuted input L0 and the
4. We should check whether we could use a 1 circular left right 32 bits is called right permuted R0.
shift (1 rotate left) or two circular left shift (2 rotate 10. For J = 1 to 16.
left). After these operations, we concatenate the Ci and 11. L(J) = R(J-1)
Di then obtain CDi 56 bits. Then change the CDi position
by using the permuted choice 2(PC-2), so we get Ki 48 12. This R(J-1) is expended from 32 bits to 48 bits by using
bits. the expansion table. The operate XOR calculation of this
R(j-1) 48 bits and K(j) 48 bits and get new nr0 48 bits.
5. After repeating this operation 16 times, we get 16
number of Ki. 13. Divided into four 12 bit blocks. The two left-most bits
and the two right-most bits represent the row and the
6. Read the input file name and the output file name the middle 8 bits represent the column of selection function
operation. Si. Then we get 8 bit from Si and after this operation 8
7. If end of encounter, the process will stop. times, we obtain 8 number of Si.
8. Read the 8 characters from input files and convert the 14. Change positions in var 32 by using the primitive
ASCII code to binary for, so we obtain the 64 bits input. function (P), and so we obtain 32 bits pvar 32.
Then change position by using initial permutation (IP). 15. This pvar 32 and L(J-1) are subjected to XOR calculation,
9. The left 32 bits is called left permuted input L0 and the thus obtain R(J).
right 32 bits is called right permuted R0. 16. Next J. After this operation, get 16 numbers of R(J) and
10. For J = 1 to 16. L(J).
11. L(J) = R(J-1) 17. Concatenate the last position of R(16), then obtain
12. This R(J-1) is expended from 32 bits to 48 bits by using preoutput RL64 bits.
the expansion table. The operate XOR calculation of this 18. Operate the initial permutation inverse (IP-1) with RL.
R(J-1) 48 bits and K(J) 48 bits and get new nr0 48 bits. Then obtain the ciphertext 64 bits.
13. Exacts 6 bits from nr0. The first bit and the last bit 19. Write to a ciphertext 64 bits to output file.
represents the row and the middle 4 bits represents the
20. Go to step 7.
column of selection function Si. Then we get 4 bits from
Si and after this operation 8 times, we obtain 8 number  Index of Coincidence (IC)
of Si. We concatenate S1 to S8 we obtain var32 bits. The index of coincidence IC, measures the variation in the
14. Change positions in var32 by using the primitive frequencies of letters in the ciphertext. If the period of cipher
function (P), and so we obtain 32 bits pvar32. is one (1), that is simple substitution has been used, there
15. This pvar32 and L(J-1) are subjected to XOR calculation, will be considerable variation in the letter frequencies of IC
thus obtain R(J). will be high. As the period increase, the variation is gradually
16. Next J. After this operation, get 16 numbers of R(J) and eliminated (due to the diffusion) and IC is low.
L(J).
17. Concatenate the last position of R(16), then obtain Let the length of the text be N and let the size of the alphabet
preoutput RL64 bits. be n. Consider the i-th letter ai in the alphabet.
Suppose ai appears in the given text Fi times. Since the
18. Operate the initial permutation inverse (IP-1) with RL.
number of ai's in the text is Fi, picking the
Then obtain the ciphertext 64 bits.
first ai has Fi different choices and picking the second ai has
19. Write to a ciphertext 64 bits to output file. only Fi-1 different choices because one ai has been selected.
20. Go to step 7. Since there are N(N-1) different ways of picking two
characters from the text, the probability of having two ais is
 Implementation of LOKI91 Algorithm
The LOKI91 Algorithm is developed by window XP personal
computer using visual C++ programming language.
1. Read a key of any 8 characters. Since the alphabet has n different letters and the above
applies to each of them, the probability of having two
identical letters from the text is’

@ IJTSRD | Unique Paper ID – IJTSRD26650 | Volume – 3 | Issue – 5 | July - August 2019 Page 1441
 International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470
D. Experimental and Simulation Analysis
We analyzed the two algorithms with English texts and these
texts are selected randomly. And then input file sizes are
Therefore, the index of coincidence is: used from small to large size. Different samples yield slightly

different result. We analyzed the performance of these

algorithms by computing Index of Coincidence (IC) and time
English has n = 26 letters. efficiency.

TABLE1 ENCRYPTION AND DECRYPTION EXECUTION TIME

Encryption Execution Decryption Execution
Input File Size(Bytes) Time(Seconds) Time(Seconds)
DES LOKI91 DES LOKI91
100 0.12 0.11 0.14 0.13
500 0.14 0.12 0.16 0.15
2000 0.15 0.13 0.17 0.14
5000 0.14 0.12 0.15 0.12
10000 0.16 0.14 0.18 0.15

TABLE2 INDEX OF COINCIDENCE (IC)

Input File Size(Bytes) Index of Coincidence (IC) for Plaintext Index of Coincidence (IC) for Ciphertex
DES LOKI91 DES LOKI91
100 0.959604 0.959604 0.067401 0.067522
500 0.955932 0.955932 0.081535 0.082189
2000 0.961995 0.961995 0.089604 0.090311
5000 0.976799 0.976799 0.102679 0.103218
10000 0.982129 0.982129 0.097445 0.100812

TABLE 1 represents the five different sizes of files and corresponding encryption and decryption execution time taken by DES
and LOKI91 algorithms in seconds. By analyzing the TABLE 1, we conclude that the encryption and decryption time taken by
LOKI91 is slightly small as compare to DES. These comparisons are shown in Fig.4.

TABLE 2 represents the five different sizes of files and corresponding Index of Coincidence (IC) by DES and LOKI91 algorithms.
By analyzing the table 2, we conclude that the IC for ciphertext by LOKI91 is large as compare to DES. These comparisons are
shown in Fig.5.

(a) (b)
Fig. 4 Execution Time for (a) Encryption (b) Decryption

Fig. 5 Index of Coincidence (IC) for Ciphertext

@ IJTSRD | Unique Paper ID – IJTSRD26650 | Volume – 3 | Issue – 5 | July - August 2019 Page 1442
 International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470
E. CONCLUSIONS [3] Abdullah Al Hasib, Abul Ahsan Md. Mahmudul Haque,"
This paper presents the performance evaluation of A Comparative Study of the Performance and Security
cryptographic algorithms for various types of files. we have Issues of AES and RSA Cryptography", Third
studied that the encryption and decryption execution time International Conference on Convergence and Hybrid
consumed by DES algorithm is not quite different for some Information Technology,2008.
sort of message compared to LOKI91 algorithm. Index of
[4] William Stallings, “Cryptography and Network Security
Coincidence (IC) for the ciphertext by DES is smaller than the
Principles and Practices.” Prentice Hall, November 16,
LOKI91. Thus, the performance of DES is very good as
2005.
compared to LOKI91.
[5] A. Nadeem, "A performance comparison of data
References encryption algorithms", IEEE information and
[1] Rishabh Arora Sandeep Sharma, PhD, “Performance communication technologies, pp.84-89, 2006.Bn
Analysis of Cryptography Algorithms”, International
[6] Gaurav Shrivastava, “Analysis Improved Cryptosystem
Journal of Computer Applications (0975 – 8887)
Using DES with RSA.” VSRDIJCSIT, Vol. 1 (7), 465-470,
Volume 48– No.21, June 2012.
2011.
[2] Sombir Singh1 , Sunil K Maakar 2 and Dr. Sudesh
[7] Charels Connell, “An Analysis of New DES: A Modified
Kumar3, “A Performance Analysis of DES and RSA
Version of DES”, Locust Street Burlington, USA, Boston
Cryptography”, International Journal of Emerging
MA 02215 USA.
Trends & Technology in Computer Science (IJETTCS),
Volume 2, Issue 3, May – June 2013.

@ IJTSRD | Unique Paper ID – IJTSRD26650 | Volume – 3 | Issue – 5 | July - August 2019 Page 1443