et

International Journal on Emerging Technologies (Special Issue NCETST-2017) 8(1): 746-750(2017)

(Published by Research Trend, Website: www.researchtrend.net)
ISSN No. (Print) : 0975-8364
ISSN No. (Online) : 2249-3255

Comparative Study of Different Cryptographic Algorithms for Data

Security in Cloud Computing
Mr. Pradeep Semwal1 and Dr. MK Sharma2
1
Research Scholar (CSE) Uttarakhand Technical University, Dehradun, (UK), INDIA
2
Associate Prof, Dept. of Comp Application Amrapali Institute, Haldwani, Nainital, (UK), INDIA
ABSTRACT: In the word of internet in every second huge amount of data being generated everyday on the
internet and stored in the cloud. Securing information stored in the cloud is a biggest challenge. Cryptography
is very useful to ensure privacy & information security for making internet a safer place. Cryptography is a
process of making information unintelligible to an unauthorized person. Hence, providing confidentiality to the
authorized users. There are various cryptographic algorithms that can be used. Ideally, a user needs a
cryptographic algorithm which is of low cost and high performance. However, in reality there is no such
algorithm which is a one stop solution of all. Thus, amongst the various cryptographic algorithms existing, we
choose an algorithm which best fits the user requirements. In, this process of choosing a study of strengths,
weakness, cost and performance of each algorithm will provide valuable insights. In this paper, we have
implemented and analyzed in detail cost and performance of popularly used cryptographic algorithms like
DES, 3DES, AES, RSA and blowfish to show an overall performance analysis.
Keywords: Cryptography, Symmetric Algorithms, Asymmetric Algorithms, AES, DES, RSA and BLOWFISH,
Encryption Decryption time, Avalance effect, Entropy.
Symmetric algorithm is also called secret key
I. INTRODUCTION
algorithm. The sender and the receiver share the same
Cryptography also termed as an art of concealing key for encryption and decryption. This shared secret
information so that only the authenticated parties can key needs to be kept secured by both the parties
have access to the private information. otherwise any one can steal the data in between the
In the Cryptography basic elements are Plain text and transmission .
Cipher text. Plain text in the original data which the There are different types of symmetric key algorithms
sender wants to send and Cipher text is the encrypted like Data Encryption Standard (DES), Triple Data
format of the plain text. The plain text is converted to Encryption Standard (3DES), and Advanced
the Cipher text using encryption algorithms and cipher Encryption Standard (AES) and Blowfish.
text is converted back to plain text using decryption
A. Data Encryption Standard (DES) Algorithm
algorithm. These algorithms are mainly classified into
Data Encryption Standard (DES) is a symmetric key
two types symmetric key algorithm and asymmetric
algorithm which was developed by IBM in 1977. It
key algorithm. In this paper, different encryption
uses key of size 56-bits to encrypt the plain text block
algorithms are discussed along with their applications.
of size 64 bit. It consists of a fiestal network which
The paper first discusses different symmetric key &
divides a block into two equal halves where the right
asymmetric key algorithms then a comparative analysis
half passes through a various function. DES uses a
of the above algorithms is various parameters.
chain of S-boxes and P-boxes. After passing through
II. SYMMETRIC KEY ALGORITHMS these permutation and substitution box the cipher text is
obtained by the XOR operation .DES uses 19 rounds.
Semwal and Sharma 746
Decryption is just the reverse process of encryption. MPEG video encryption [18]. The algorithm was
DES is not a good algorithm to trust on as it is modified to overcome calculations and computation
vulnerable to brute force attacks. The DES algorithm overhead.
has been modified (called M-DES) to improve the Bit
D. Blowfish Encryption Algorithm
Error Rate(BER ) caused due to avalanche effect and is
Blowfish Algorithm , one of the most efficient
made more secure so that it can be used in wireless
algorithm was developed by Bruce Schneier in 1993 It
communication. For modification the authors have
has a variable key length maximum up to 448 bits. It
made use of S-box mapping tables. The second
has a block size of 64-bits. Blowfish algorithm consists
modification has been done from the work in where the
of two phases. The first phase is key expansion phase,
authors have shown that DES can be cracked from the
in this phase 448 bit key is converted into number of
differential cryptanalysis attack. The BER [Bit Error
sub keys totaling 4168 bytes [19].The second phase is
Rate] in M-DES is much better than DES, because
encryption phase, a function is iterated 16 times and the
there is no Avalanche effect in M-DES so came out
encrypted text is obtained using XOR operation.
with good results but it is vulnerable to Men in Middle
Blowfish is a strong encryption algorithm so it has been
attack.
used in many applications.
B. Triple Data Encryption Standard (3DES) Algorithm Certain tests [20] were applied to check the
Triple Data Encryption Standard also called as 3DES performance of blowfish algorithm by increasing the
was introduced by IBM in 1978 to enhance the security file size and the key length . The Password
of the data. It uses block size of 64-bits with a key Management System is also based on Blowfish
length of 56bits. As the name suggests it performs the Algorithm [21].The algorithm has also been used in
same DES algorithm but three times to each data block. bitmap image plotting in place of secret algorithms like
Although the algorithm is vulnerable to brute force Skipjack algorithm in the Clipper and Capstone chips
attack but it is comparatively more secure than DES [22], [23]. Performance was also evaluated by
and 2DES.It was mainly designed to make it secure modifying its function which brought up good results
form Men in Middle attack. discussed in [26].
Now a day’s 3-DES is used in many applications, so
III. ASYMMETRIC KEY ALGORITHM
some measures must be taken to implement it in a
modified form. We have discussed very powerful & widely used
asymmetric algorithms in this section.
C. Advanced Encryption Standard (AES) Algorithm
Asymmetric Key Algorithm is also called public key
There are certain vulnerabilities in DES and 3DES, so
cryptography. It uses two keys ‘Private Key’ and
NIST (National Institute of Standard and Technology)
‘Public key’. The sender before transmission encrypts
developed a new algorithm called Advanced
the plain text with the help of public key to produce
Encryption Standard (AES).
cipher text and the receiver decrypts this cipher text
AES work on blocks of three different sizes 128 bit,
with the help of its private key. One such powerful
192 bit and 256 bits .AES -128 uses 10 rounds, AES-
asymmetric algorithm is Rivest Shamir Adlemen
192 has 12 rounds and AES-256 consist of 14 rounds.
(RSA).
Each round goes through a series of steps like
substitution byte, shift rows, mixed columns and add A. Rivest Shamir Adlemen (RSA)
round Key. AES Algorithm is comparatively more The algorithm was developed by Rivest, Shamir and
secure and has a strong avalanche effect. Attackers Adlemen in 1977. It is a public key algorithm because
cannot easily decrypt the encrypted text by the brute it uses two keys one to encrypt and other to decrypt the
force attack. Therefore AES has been used in many message. Public key is used by the sender to the private
applications like it is used PDA communication .There key (only known to receiver) is used by the receiver to
are many attacks on AES algorithm ,one such attack decrypt the message. This private key, as the name
which is a combination of boomerang and rectangle suggests is known only to the receiver. The RSA
attack with related key differentials . This attack can consists of some mathematical operations through
break the round versions of AES but not complete AES. which it can calculate the encryption and decryption
There are attacks which occur due to the vulnerability keys (E and D), after that one can easily calculate the
of S-box in AES algorithm. cipher text and the plain text by the following formula.
A modified version of AES was introduced to carry out C =ME mod(n)……. (1)
Semwal and Sharma 747
P =MDmod(n)…… (2) Table1 & Table 2
Where E & D are public and private keys and n is a : Comparative analysis of different cryptography
value obtained from mathematical operations in RSA . algorithms
To carry out performance analysis RSA was modified.
Table 1
Although RSA is a secure algorithm,
but in [29] an experiment was done in the application of
low private exponent attack in RSA where the author
found out that there can be some new weak keys in
RSA. Therefore, digital signature concept was
introduced in combination with RSA [30]. So algorithm
implementing Digital Signature with RSA Algorithm
[31] was proposed to double the security of the
algorithm. The RSA has been used in various
applications like in e-com which ensure message
integrity, privacy, authentication and non-repudiation.
In the next section, a comparative analysis of different
algorithms is given.
IV. COMPARATIVE ANALYSIS
The Table 1 & Table 2 shows the comparative analysis
between different symmetric and asymmetric
algorithms at different attributes such as the key length,
block size, rounds, power consumption, avalanche
effect, processing time & resource consumption.
In [34] the authors have encrypted files with different
contents and sizes. The results proved that Blowfish Table 2
showed a good performance than the other encryption
algorithms and therefore the processing time of the
blowfish algorithm was high. AES performance was
better than DES and 3DES and it took less time in
encryption and decryption. Next property, Avalanche
effect is a property of block ciphers in which the output
bits change significantly on a slight change of the input
bits. Blow fish has a maximum avalanche effect due to
the number of XOR operations which changes the
output drastically. DES has avalanche lower than AES
[35]. RSA also has high avalanche effect as it involves
the mathematical calculation of two large prime
numbers. Now, talking about cryptanalysis resistance,
authors have explained differential cryptanalysis for
each of the algorithm. It was observed that DES is
highly vulnerable to linear and differential
cryptanalysis. It was also found that 3DES and
Blowfish were vulnerable to brute force attacks
whereas in case of RSA brute force attack was difficult.
AES proved to be strong against differential, linear
interpolation and square attacks [36]. Therefore the
crack to AES algorithm has not been found yet.
Comparing with the other algorithms only DES is the V. IMPLEMENTATION
most insecure algorithm as it has already been declared
inadequate to use. We have implemented and compared DES, 3DES, AES,
blowfish and RSA algorithms in java using Eclipse IDE.
Semwal and Sharma 748
We have used java inbuilt packages like java security and B. Decryption time
java crypto which provides security features like
encryption, decryption, key generation, message
authentication and authorization. We have used files with
text and images of sizes 25KB, 50KB, 1
MB,2MB,3MB.For sake of comparison we have used the
same input files for all algorithms throughout the
experiment. We have used assame system for all
implementations and analysis work, so that memory and
processor conditions. All block cipher algorithms are set in
mode ECB. The method of implementing algorithms using
functions of java.security and java.crypto package is as
follows:-
Generatekey() using keygenerator class, createacipher
object() with parameters algorithm name and mode, Fig. 2. Decryption timevs. Filesize for DES, 3DES,
initializethecipher() created for encryption / decryption and AES, Blowfish and RSA.
perform encryption/ decryption using doFinal()method. Fig. 2. shows that among all algorithms, RSA takes
VI. EVALUATION PARAMETERS highest time and blowfish takes least time for
decryption
Each of the encryption techniques has its own strong and
weak points. In order to apply a suitable cryptography C. Memory Consumption
algorithm to an application, we should have knowledge Table 3.
regarding performance, strength and weakness of the
algorithms. Therefore, these algorithms must be analyzed
based on several features. In this paper, analysis is done
with following metrics under which the cryptosystems can
be compared: Encryption time, Decryption time, Avalanche
effect, Memory used
VII. RESULTS AND DISCUSSIONS
In this section we discuss the results obtained from Table 3 shows that memory used for unit operations
implementation in java based on above four evaluation for listed algorithms.
parameters. D. Avalanche Effect
A. Encryption time In cryptography, a property called diffusion reflects
Experiment and the fig 1 reveal that RSA takes highest time cryptographic strength of an algorithm. If there is a
for encryption, and blowfish takes least time for encryption, small change in an input the output changes
significantly. This is also called avalanche effect. We
have measured Avalanche effect using hamming
distance. Hamming distance is measure of
dissimilarity. We find hamming distance as sum of bit
by XOR considering ASCII value. A high degree of
diffusion i.e. high avalanche effect is desired.
Avalanche effect reflects performance of cryptographic
algorithm.
Avalanche effect = (hamming distance ÷file size)
Avalanche effect tells us the degree of diffusion of
information. A change of one bit in plain text leading to
significant change in bits of output information. AES
uses a substitution permutation network using
Fig.1. Encryption time vs. File size for DES, 3DES, multiplicative inverse and affine transformation.
AES, Blowfish and RSA.
Semwal and Sharma 749
 Symposium (RWS) Phoenix, pp. 219-222 , Jan 2011.
[4]. H. Yoshikawa, M. Kaminaga, A. Shikoda, and T. Suzuki,
“Round addition DFA for microcontroller implemented the
Triple DES,” IEEE Consumer Electronics (GCCE) Tokyo,
pp. 538-539, October2013.
[5]. W.Y Zibideh. and M. M. Matalgah, “An Optimized
Encryption Framework based on the Modified-DES
Algorithm: A Trade-Off between Security and Throughput in
Wireless Channels,” IEEE Radio and Wireless Symposium
(RWS) CA, pp.419-422, January, 2012.
[6]. E. Biham and A. Shamir, “Differential Cryptanalysis of
the Full 16- Round DES,” Proceedings of Crypto’ 92, vol.
740, Santa Barbara, CA, December1991.
[7]. P. Kitsos, S. Goudevenos and O. Koufopavlou, “VLSI
Fig. 3. Shows that AES has highest Avalanche effect implementations of the triple-DES block cipher,” IEEE
where as RSA shows least Avalanche effect. Electronics Circuits and Systems, Vol. 1, pp.76-79, December
VIII. CONCLUSION 2003.
[8]. NIST Special Pubilication 800-20, “Modes ofOperation
Each encryption algorithm has its own strong and Validation System for the Triple Data Encryption Algorithm,”
weak points. From the experiment results shows National Institute of Standard and Technology, 2000.
-Blowfish is best in terms of memory requirement whereas [9]. LIU Niansheng , G. Donghui, and H. Jiaxiang, “AES
RSA has a large memory requirement, so blowfish can fit Algorithm Implemented for PDA Secure Communication
well in small application specially in embedded with Java,” IEEE Anti-counter. Sec. Ident. Fujian, pp. 217-
applications. 222, April 2007.
-As for encryption time is concerned RSA consumes [10]. E. Biham, O. Dunkelman, and N. Keller, “Related-Key
maximum time as compare to other cryptographic algorithm Boomerang and Rectangle Attacks,” Lecture Notes in
whereas blowfish has least encryption time. Computer Science, vol. 3494, pp. 507-525,Berlin: Springer-
-The avalanche effect of AES is maximum, so AES can be Verlag, 2005.
preferred for application where privacy and integrity of the [11]. Y. A. Zhang and D.G. Feng, “Equivalent Generation of
message is of top priority. the S-box of Rijndael,” Chinese J. Computers, Vol. 27, no.12,
-The bandwidth consumption of AES is highest for the pp.1593-1600, December 2004.
transmission of encrypted message where as it is least for [12]. W. Millan, “How to Improve the Nonlinearity of
DES. Bijective S-boxes,” Lecture Notes in Computer Science, Vol.
1438, pp.181 - 192, Berlin: Springer-Verlag, 1998.
REFERENCES [13]. Chen and D. G. Feng, “An Evolutionary Algorithm to
Improve the Nonlinearity of Self-inverse S-Boxes,” Lecture
[1]. T. Bala and Y. Kumar, “Asymmetric Algorithms and
Notes in Computer Science, vol. 3506, pp.352- 361, Berlin:
Symmetric Algorithms: A Review,” International Journal of
Springer-Verlag, 2005.
Computer Applications (ICAET), pp.1-4, 2015.
[14]. J. M. Liu, B. D. Wei, and X.G. Cheng, “An AES SBox
[2]. W. Stallings, Cryptography and Network Security, 4th
to Increase Complexity and Cryptographic Analysis, ” IEEE
Ed, pp. 58-309, Prentice Hall,2005.
Proc. of the 19th International Conference on Advanced
[3]. W. Y. Zibideh and M. M. Matalgah, “Modified-DES
Information Networking.
Encryption Algorithm with Improved BER Performance in
Wireless Communication,” IEEE Radio and Wireless

Semwal and Sharma 750