Accelerat ing t he world's research.

Survey
aarthy arun

Related papers Download a PDF Pack of t he best relat ed papers 

A Survey on Net work Securit y and Securit yAut hent icat ion using Biomet rics
IJSRD Journal

Int ernat ional Journal of Emerging Trends

rasha sakr

Crit ical Analysis of Various Symmet ric Key Crypt ographic Algorit hms
Int ernat ional Journal IJRIT CC
 I nternational Journal of E merging Trends & Technology in Computer Science (I JE TTCS)
Web Site: www.ijettcs.org Email: [email protected]
Volume 3, Issue 4, July-August 2014 ISSN 2278-6856

A Survey on Various Cryptography Techniques

Mitali1, Vijay Kumar2 and Arvind Sharma3
1,2,3
Swami Devi Dyal Group of Professional Institutions, Barwala,
Distt. Panchkula, Haryana, India

Abstract
In modern era, evaluation of networking and wireless recipient and also by anyone who gets an access to

 Cipher Text: Cipher means a code or a secret

networks has come forward to grant communication that message.
anywhere at any time. Security of wireless networks is main
aspect and the process of cryptography plays an important message. When a plain text is codified using any
role to provide the security to the wireless networks. There are suitable scheme the resulting message is called as
various cryptography techniques both symmetric and
 Encryption: The process of encoding plain text
cipher text.
asymmetric. The survey is done on some of the more popular
and interesting cryptography algorithms currently in use and
messages into cipher text messages is called
their advantages and disadvantages are also discussed. This
 Decryption: The reverse process of transforming
encryption.
paper provides a fair performance comparison between the
various cryptography algorithms on different settings of data
packets. In this paper we analyze the encryption and cipher text messages back to plain text is called as

 Key: An important aspect of performing encryption

decryption time of various algorithms on different settings of decryption.
data.
Keywords: Encryption, DES, AES, Blowfish, RSA and decryption is the key. It is the key used for
encryption and decryption that makes the process of
1. INTRODUCTION cryptography secure.
Cryptography [1, 2] is the art and science of achieving 2.2 Purpose of Cryptography
security by encoding messages to make them readable.
 Confidentiality: The principle of confidentiality
Cryptography serves following purposes:
The high growth in the networking technology leads a
common culture for interchanging of the data very specifies that only the sender and the intended
drastically. Hence it is more vulnerable of duplicating of recipient should be able to access the contents of a

 Authentication: Authentication mechanisms help to

data and re-distributed by hackers. Therefore the message.
information has to be protected while transmitting it,
Sensitive information like credit cards, banking establish proof of identities. This process ensures that

 Integrity: The integrity mechanism ensures that the

transactions and social security numbers need to be the origin of the message is correctly identified.
protected. For this many encryption techniques are
existing which are used to avoid the information theft. In contents of the message remain the same when it

 Non- repudiation: Non-repudiation does not allow the

recent days of wireless communication, the encryption of reaches the intended recipient as sent by the sender.
data plays a major role in securing the data in online
transmission focuses mainly on its security across the sender of a message to refute the claim of not sending

Access Control: Access Control specifies and controls

the message.
wireless. Different encryption techniques are used to
protect the confidential data from unauthorized use.

Availability: The principle of availability states that

who can access what.
Encryption is a very common technique for promoting the
information security. The evolution of encryption is
moving towards a future of endless possibilities. Everyday resources should be available to authorized parties all
the times.
new methods of encryption techniques are discovered.
This paper holds some of those recent existing encryption
techniques and their comparison.
2.3 Types of Cryptography
2. LITERATURE SURVEY
 Symmetric Key Cryptography: When the same key is
Some of the concepts used in cryptography are Two types of cryptography is studied:
described here [1]:
used for both encryption and decryption, then that
2.1 Cryptography
 Plain Text: Any communication in the language that  Asymmetric Key Cryptography: When two different
mechanism is known as symmetric key cryptography.

we speak- that is the human language, takes the form keys are used, that is one key for encryption and
of plain text. It is understood by the sender, the another key for decryption, then that mechanism is

Volume 3, Issue 4 July- August 2014 Page 307

 I nternational Journal of E merging Trends & Technology in Computer Science (I JE TTCS)
Web Site: www.ijettcs.org Email: [email protected]
Volume 3, Issue 4, July-August 2014 ISSN 2278-6856

known as asymmetric key cryptography. 3.2DES

3DES (Triple DES) is an enhancement of DES; it is 64
bit block size with 192 bits key size. In this standard the
encryption method is similar to the one in the original
DES but applied 3 times to increase the encryption level
and the average safe time. It is a known fact that 3DES is
slower than other block cipher methods. It uses either two
or three 56 bit keys in the sequence Encrypt-Decrypt-
Encrypt (EDE). Initially, three different keys are used for
Figure 3.1: Classification of Cryptography the encryption algorithm to generate cipher text on plain
text message, t.
3. RELATED WORKS C(t) = Ek1(Dk2(Ek3(t))) (1)
This subsection describes and examines previous work on Where C(t) is cipher text produced from plain text t,
most common algorithm. Ek1 is the encryption method using key k1
Dk2 is the decryption method using key k2
3.1 DES
Ek3 is the encryption method using key k3
DES is a block cipher that uses shared secret key for Another option is to use two different keys for the
encryption and decryption. DES algorithm as described encryption algorithm which reduces the memory
by Davis R. [3] takes a fixed-length string of plaintext requirement of keys in TDES.
bits and transforms it through a series of complicated C(t) = Ek1(Dk2(Ek3(t))) (2)
operations into cipher text bit string of the same length.
In the case of DES, each block size is 64 bits. DES also
uses a key of 56 bits to customize the transformation, so
that decryption can only be performed by those who know
the particular key used to encrypt the message. There are
16 identical stages of processing, termed rounds. There is
also an initial and final permutation, termed IP and FP,
which are inverses (IP "undoes" the action of FP, and vice
versa). The Broad level steps in DES are as follows [1]:
1. In the first step, the 64-bit plain text message is
handed over to an Initial permutation (IP) function.
2. The initial permutation is performed on plain text.
3. The IP produces two halves of the permuted message;
Left Plain Text (LPT) and Right Plain Text (RPT).
4. Now, each of LPT and RPT go through 16 rounds of Figure 3.2: Encryption in 3DES
encryption process. TDES algorithm with three keys requires 2^168 possible
5. In the end, LPT and RPT are rejoined and a final combinations and with two keys requires 2^112
permutation (FP) is performed on the combined combinations. It is practically not possible to try such a
block. huge combination so TDES is a strongest encryption
6. The result of this process produces 64-bit cipher text. algorithm. The disadvantage of this algorithm it is too
Rounds: Each of the 16 rounds, in turn, consists of the time consuming.
broad level steps and shown in Figure 3.1. 3.3 AES
The AES cipher [6] is almost identical to the block cipher
Rijndael cipher developed by two Belgian cryptographers,
Joan Daemen and Vincent Rijmen. The algorithm
described by AES is a symmetric-key algorithm, meaning
the same key is used for both encrypting and decrypting
the data. The number of internal rounds of the cipher is a
function of the key length. The number of rounds for 128-
bit key is 10. Unlike its predecessor DES, AES does not
use a Feistel network. Feistel networks do not encrypt an
entire block per iteration, e.g., in DES, 64/2 = 32 bits are
encrypted in one round. AES, on the other hand, encrypts
all 128 bits in one iteration. This is one reason why it has
a comparably small number of rounds.
Figure 3.1: Details of One Round in DES

Volume 3, Issue 4 July- August 2014 Page 308

 I nternational Journal of E merging Trends & Technology in Computer Science (I JE TTCS)
Web Site: www.ijettcs.org Email: [email protected]
Volume 3, Issue 4, July-August 2014 ISSN 2278-6856

Figure 3.3: One Round of encryption and Decryption in

AES
Encryption Round Decryption Round Each processing

 Substitute byte: a non-linear substitution step where

round involves four steps:-

each byte is replaced with another according to a

 Shift rows: a transposition step where each row of the

lookup table.

 Mixcoloumn: a mixing operation which operates on

state is shifted cyclically a certain number of steps. Figure 3.4: Blowfish Encryption

the columns of the state, combining the four bytes in Operation of Blowfish:
Blowfish encrypts 64-bit block cipher with variable length
 Add round key: each byte of the state is combined
each column.
 Subkey Generation: This process converts the key
key. It contains two parts
with the round key using bitwise XOR.
 Data Encryption: This process involves the iteration
AES encryption is fast and flexible. It can be upto 448 bits long to subkeys to totaling 4168 bits.
implemented on various platforms especially in small
devices. of a simple function 16 times. Each round contains a
AES Encryption: key dependent permutation and key- and data
The encryption process in AES involves following steps: dependent substitution.
(i) Do the one-time initialization process: Blowfish suits the applications where the key remain
(a) Expand the 16-byte key to get the actual Key constant for a long time (e.g. communication link
Block to be used. encryption) but not where the key changes frequently (e.g.
(b) Do one time initialization of the 16-byte plain text packet switching).
block (called State). 3.5 RSA
(c) XOR the state with the key block RSA is a public key algorithm invented by Rivest, Shamir
(ii) For each round do the following: and Adleman [7]. The key used for encryption is different
(a) Apply S-Box to each of the plain text bytes. from (but related to) the key used for decryption. RSA
(b) Rotate row k of the plain text block (i.e. state) by involves a public key and a private key. The public key
k bytes. can be known to everyone and is used for encrypting
(c) Perform mix columns operation. messages. Messages encrypted with the public key can
(d) XOR the state with the key block. only be decrypted using the private key. The keys for the
3.4 Blowfish RSA algorithm are generated the following way:
Blowfish [5] is one of the most common public domain 1. Choose two distinct large prime numbers p and q.
encryption algorithms provided by Bruce Schneier - one 2. For security purposes, the integer’s p and q should be
of the world's leading cryptologists, and the president of chosen at random, and should be of similar bit-
Counterpane Systems, a consulting firm specializing in length. Prime integers can be efficiently found using
cryptography and computer security. The Blowfish a primarily test.
algorithm was first introduced in 1993. The blowfish 3. Compute n = pq; n is used as the modulus for both
encryption is shown in figure below: the public and private keys
4. Select the public key (i.e. the encryption key) E such
that it is not a factor of (p − 1) and (q − 1).

Volume 3, Issue 4 July- August 2014 Page 309

 I nternational Journal of E merging Trends & Technology in Computer Science (I JE TTCS)
Web Site: www.ijettcs.org Email: [email protected]
Volume 3, Issue 4, July-August 2014 ISSN 2278-6856

5. Select the private key (i.e. the decryption key) D such 3DES:
that the following equation is true: Advantages
(D*E) mod (p-1)*(q-1) = 1 1) It uses 64 bit block size with 192 bits of key size. It is
6. For encryption, calculate the cipher text CT from the simple like DES because the encryption method is
plain text PT as follows: similar to the one in the original DES but applied 3
CT = PT^E mod N (3.1) times to increase the encryption level and the average
7. Select CT as the cipher text to the receiver. safe time.
8. For decryption, calculate the plain text PT from the 2) 3DES is easy to implement (and accelerate) in both
cipher text CT as follows: hardware and software.
PT = CT^D mod N (3.2)
Disadvantages
3.6 Comparison 1) 3DES is slower than other block cipher methods.
Comparative study of the cryptographic algorithms both 2) It has poor performance.
symmetric as well as asymmetric has been done. AES
Advantages
Table 1: Comparison of Cryptography Algorithms 1) The purpose of the AES algorithm is to replace the
ALGORITH CREATED KEY BLO older and less reliable algorithms, such as Data
M BY SIZE CK Encryption Standard (DES).
(BITS) SIZ 2) AES encryption is fast and flexible.
E 3) The AES has also been employed in other areas such
(BIT as to secure information in smart cards and online
S) transactions.
DES IBM in 56 64 4) Until May 2009, the only successful published
1975 attacks against the full AES were side-channel
3DES IBM in 112 or 64 attacks on some specific implementations.
1978 168 5) In June 2003, the U.S. Government announced that
AES JOAN 256 128 AES could be used to protect classified
DAEMEN information.
& 6) The design and strength of all key lengths of the
VINCENT AES algorithm (i.e., 128, 192 and 256) are
RIJMEN IN sufficient to protect classified information up to the
1998 SECRET level. TOP SECRET information will
BLOWFISH BRUCE 32 - 448 64 require use of either the 192 or 256 key lengths.
SCHNEIER Disadvantages
IN 1993 1) AES in Galois/Counter Mode (GCM) is challenging
E. Thambiraja, G.Ramesh and Dr. R. Umarani in [8] to implement in software.
have done survey on most common encryption 2) The size of key length is too long that makes it
techniques. Monika Agrawal and Pradeep Mishra in [9] complex sometimes.
have also done a comparative survey on Symmetric Key Blowfish
Encryption Techniques. Gurjeevan Singh, Ashwani 1) Blowfish is block cipher 64-bit which can also be
Kumar Singla and K.S.Sandha in [4] have provided used as a replacement for the DES algorithm. It
comparison of various cryptographic algorithms. takes a variable length key, ranging from 32 bits to
DES 448 bits; default 128 bits.
Advantages and Disadvantages of DES are Advantages 2) Blowfish is fast as its encryption rate on 32-bit
1) DES algorithm has been a popular secret key microprocessor is 26 clock cycles per byte.
encryption algorithm and is used in many 3) It is compact as it can execute in less than 5 kb
commercial and financial applications. memory.
2) Although introduced in 1976, it has proved resistant 4) It is simple because it uses only primitive operations
to all forms of cryptanalysis. like addition, XOR and table lookup, making its
Disadvantages design and implementation simple.
1) Its key size is too small by current standards and its 5) It has a variable key length upto a maximum of 448
entire 56 bit key space can be searched in bits long making it both flexible and secure.
approximately 22 hours. 6) No attack is known to be successful against this.
2) It was recognized that DES was not secure because of Blowfish is unpatented, license-free, and is
advancement in computer processing power available free for all uses. Blowfish has variants of
14 rounds or less.
7) Blowfish is considered to be the best out of all
encryption algorithms.

Volume 3, Issue 4 July- August 2014 Page 310

 I nternational Journal of E merging Trends & Technology in Computer Science (I JE TTCS)
Web Site: www.ijettcs.org Email: [email protected]
Volume 3, Issue 4, July-August 2014 ISSN 2278-6856

Average 542.38 742.31 91.92 663.31

RSA Time
Advantages
1) The primary advantage of RSA is increased
security: as the private keys do not ever need to be
transmitted or revealed to anyone. Whereas in a
secret-key system, there is always a chance that an
enemy could discover the secret key while it is
being transmitted.
2) Another major advantage of public-key systems is
that they can provide a method for digital
signatures. Authentication via secret-key systems
requires the sharing of some secret and sometimes
requires trust of a third party as well.
3) Digitally signed messages can be proved authentic Figure 2: Encryption Time of Each Algorithm (In ms)
to a third party, such as a judge, thus allowing such The results for the comparison described in Figure 2
messages to be legally binding. shows the superiority of Blowfish algorithm over the
Disadvantages other algorithms in terms of the processing encryption
1) A disadvantage of using public-key cryptography for time. Because less the time; less will be the power
encryption is speed: they are very slow in consumption and more the speed of the algorithm. Second
processing. point can be noticed here that AES has advantage over
For encryption, the best solution is to combine public- and the other 3DES and DES in terms of processing
secret-key systems in order to get both the security encryption time except Blowfish. In third point we say
advantages of public-key systems and the speed can that DES has better performance than 3DES. Fourth
advantages of secret-key systems. The study so far shows point which has been concluded that 3DES has least
the superiority of Blowfish algorithm over other performance than all.
algorithms in terms of the processing time. Blowfish has
a better performance than other common encryption
4. CONCLUSION
algorithms used. Since Blowfish has not any known
security weak points so far, this makes it an excellent In this wireless world nowadays, the security for the data
candidate to be considered as a standard encryption has become highly important since the selling and buying
algorithm. Gurjeevan Singh, Ashwani Kumar Singla and of products over the open network occur very frequently.
K.S.Sandha have provided comparative analysis of In this paper, it has been surveyed about the existing
encryption algorithms. The four encryption algorithms works on the encryption techniques. Those encryption
(AES. 3DES, Blowfish and DES) have been tested with techniques are studied and analyzed well to promote the
different text file sizes. The experiment results are shown performance of the encryption methods also to ensure the
below: Comparison of encryption time has been explained security proceedings. This paper presents the performance
in the Table 2 and also the execution time of various evaluation of selected symmetric algorithms. The selected
encryption algorithms on different text file size. algorithms are AES, 3DES, Blowfish and DES. The
Table 2: Comparative Encryption Times (In ms) of presented simulation results show the numerous points.
various algorithms with different packet size Firstly it was concluded that Blowfish has better
Text File AES 3DES Blowfish DES performance than other algorithms followed by AES.
Size 3DES has least efficient of all the studied algorithms. In
(in Kbytes) future we can use Encryption techniques in such a way
20 42 34 25 20 that it can consume less time and power furthermore; we
48 55 55 37 30 try to develop stronger Encryption Algorithm with high
108 40 48 45 35 speed and minimum energy consumption..
242 91 82 46 51
322 115 115 48 47 References
780 165 170 65 85 [1.] Atul Kahate “Cryptography and Network Security”,
910 213 230 68 145 Tata McGraw-Hill Companies, 2008.
5501 260 310 120 250 [2.] William Stallings “Network Security Essentials
7200 210 286 109 260 (Applications and Standards)”, Pearson Education,
7838 1240 1470 122 1280 2004.
22335 1370 1800 155 1720 [3.] Davis, R., “The Data Encryption Standard in
42000 1530 2300 165 2100 Perspective,” Proceeding of Communication Society
99000 1720 2750 190 2600

Volume 3, Issue 4 July- August 2014 Page 311

 I nternational Journal of E merging Trends & Technology in Computer Science (I JE TTCS)
Web Site: www.ijettcs.org Email: [email protected]
Volume 3, Issue 4, July-August 2014 ISSN 2278-6856

magazine, IEEE, Volume 16 No 6, pp. 5-6, Nov. Devi Dyal Group of Professional Institutions, Barwala,
1978. Haryana, India.
[4.] Gurjeevan Singh, Ashwani Kumar Singla,
K.S.Sandha “ Performance Evaluation of Symmetric
Cryptography Algorithms,” International Journal of
Electronics and Communication Technology
Volume 2 Issue 3, September 2011.
[5.] Pratap Chnadra Mandal “Superiority of Blowfish
Algorithm,” International Journal Of Advanced
Research in Computers Science and Software
Engineering Vol 2 Issue 9, September 2012.
[6.] Daemen, J., and Rijmen, V. "Rijndael: The
Advanced Encryption Standard." Dr. Dobb's Journal,
March 2001.
[7.] R.L.Rivest, A.Shamir, and L.Adleman, “A Method
for Obtaining Digital Signatures and Public-Key
Cryptosystems,” Communication of the ACM,
Volume 21 No. 2, Feb. 1978.
[8.] E. Thambiraja, G.Ramesh, Dr. R. Umarani, “A
survey on various most common encryption
techniques,” International Journal of Advanced
Research in ComputerScience and Software
Engineering, Vol 2, Issue 7, July 2012.
[9.] Monika Agrawal, Pradeep Mishra,” A Comparative
Survey on Symmetric Key Encryption Techniques,”
International Journal on Computer Science and
Engineering (IJCSE), Vol. 4 No. 05 May 2012,
PP877-882.
AUTHOR

Mitali1 received the B.Tech. degree in

Computer Engineering from Haryana
College of Technology & Management,
Kaithal, Haryana, India in 2010 and
pursuing M.Tech in Computers Engineering from year
2012 from Swami Devi Dyal Group of Professional
Institutions, Barwala, Haryana, India. She has worked as
a lecturer in CSE Department in T.R. Abhilashi
Memorial Institute of Engineering and Technology, Distt.
Mandi, H.P., India for more than 1 year i.e. 1st Aug, 2010
– 31st Aug, 2011.

Vijay Kumar2 received the B.Tech.

degree in Computer Engineering from
CITM, Faridabad, Haryana in 2010 and
M.Tech. degree in Computer Engineering
from Deenbandhu Chhotu Ram University, Murthal,
Haryana, India in 2013. He has qualified GATE in 2011-
2012. He is now working as an Assistant Professor in
Computers Department in Swami Devi Dyal Group of
Professional Institutions, Barwala, Haryana, India.
Arvind Sharma3 received the B.Tech. and
M.Tech. degrees in Computer Engineering
from Maharishi Markandeshwar University,
Muulana, Haryana, India in 2012 and 2014,
respectively. He is now working as an
Assistant Professor in Computers Department in Swami

Volume 3, Issue 4 July- August 2014 Page 312