Twenty-first century is the era of globalization and digitization. Nowadays, internet rules every aspect of life. Today, human life and activities are not limited to a society or locality. By means of social networking and service oriented architecture each and every emotion and action is computerized. Therefore, data security and privacy preservation need ultimate priority and attention. Cryptography is the part of computer science which deals with information security. Diverse cryptographic methodologies are available for different media. Ensuring and enhancing security of text data is of utmost importance, as, majority of online communication still happens via text media. The method of transforming original text into unintelligible cipher text before sending it through insecure channel is called encryption and the reverse process is decryption. Modern day encryption is broadly classified into two categories – Symmetric key or private key cryptography and Asymmetric key or public key cryptography. This paper presents a detail survey on symmetric key cryptography, where same key is used for both encryption and decryption. All available private key encryption methods have been properly reviewed and analyzed, enlisting their advantages and limitations over each other.

1.
A.B.
Forouzan
and
D.
Mukhopadhyay
,
Cryptography and network security
(
McGraw-Hill Education
,
Sie
,
2011
)
2.
W.
Stallings
,
Network Security Essentials: Applications and Standards, 4/e
(
Pearson Education
India
,
2003
)
3.
R.
Davis
, “
The data encryption standard
” in
IEEE Communications Society Magazine
, pp.
5
9
4.
G.
Ramesh
and
R.
Umarani
, “
Data security in local area network based on fast encryption algorithm
” in
International Conference on Network Security and Applications
(
Springer
,
Heidelberg, Berlin
,
2010
), pp.
11
26
5.
A.S.D.
Minaam
,
M.H.
Abdual-Kader
and
M.M.
Hadhoud
,
Evaluating the Effects of Symmetric Cryptography Algorithms on Power Consumption for Different Data Types
(
IJ Network Security
,
11
(
2
),
2010
), pp.
78
87
6.
K.A.
Mandal
,
C.
Parakash
and
A.
Tiwari
, “
Performance evaluation of cryptographic algorithms: DES and AES
,” in
2012 IEEE Students’ Conference on Electrical, Electronics and Computer Science
(
IEEE
,
2012
), pp.
1
5
7.
J.
Dolske
and
M.
Curtin
, “
A brute force search of DES keyspace
,” in
8th Usenix Symposium January
(
1998
),pp.
26
29
8.
A.
Shamir
and
E.
Biham
, “
Differential cryptanalysis of the full 16-round DES
,” in
Annual International Cryptology Conference
(
Springer
,
Heidelberg, Berlin
,
1992
), pp.
487
496
9.
D.
Wagner
,
J.
Kelsey
and
B.
Schneier
, “
Related-key cryptanalysis of 3-way, biham-des, cast, des-x, newdes, rc2, and tea
,” in
International Conference on Information and Communications Security
(
Springer
,
Heidelberg, Berlin
,
1997
) pp.
233
246
10.
D.
Khovratovich
,
G.
Leurent
and
C.
Rechberger
, “
Narrow-Bicliques: cryptanalysis of full IDEA
,” in
Annual International Conference on the Theory and Applications of Cryptographic Techniques
(
Springer
,
Berlin, Heidelberg
,
2012
) pp.
392
410
11.
K.
Bhargavan
and
G.
Leurent
, “
On the practical (in-) security of 64-bit block ciphers: Collision attacks on HTTP over TLS and OpenVPN
,” in
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security
(
ACM
,
2016
) pp.
456
467
12.
A.
Klein
, “
Designs, codes and cryptography”
in
Attacks on the RC4 stream cipher
, pp.
269
286
13.
E.
Biham
and
O.
Dunkelman
, “
Cryptanalysis of the A5/1 GSM stream cipher
,” in
International Conference on Cryptology in India
(
Springer
,
Berlin, Heidelberg
,
2000
) pp.
43
51
14.
D.
Coppersmith
, “
The Data Encryption Standard (DES) and its strength against attacks
,” in
IBM journal of research and development
(
1994
), pp.
243
250
15.
C.
Paar
,
K.
Schramm
and
T.
Wollinger
, “
A new class of collision attacks and its application to DES
,” in
International Workshop on Fast Software Encryption
(
Springer
,
Berlin, Heidelberg
,
2003
), pp.
206
222
16.
N.
Gupta
and
S.S.
Srivastava
, “
Security aspects of the Extended Playfair cipher
,” in
2011 International Conference on Communication Systems and Network Technologies
(
IEEE
,
2011
), pp.
144
147
17.
P.J.
Delescaille
and
J.J.
Quisquater
, “
New results and applications to DES
,” in
Conference on the Theory and Application of Cryptology
(
Springer
,
New York, NY
,
1989
), pp.
408
413
18.
J.M.
Wiener
, and
C. P.
Van Oorschot
, “
A known-plaintext attack on two-key triple encryption
,” in
Workshop on the Theory and Application of of Cryptographic Techniques
(
Springer
,
Berlin, Heidelberg
,
1990
), pp.
318
325
19.
J.D.
Bernstein
, “
Cache-timing attacks on AES,”
(
2005
)
20.
I.
Mironov
and
J.
Bonneau
, “
Cache-collision timing attacks against AES
,” in
International Workshop on Cryptographic Hardware and Embedded Systems
(
Springer
,
Berlin, Heidelberg
,
2006
), pp.
201
215
21.
A.
Shamir
,
A.D.
Osvik
and
E.
Tromer
, “
Efficient cache attacks on AES, and countermeasures
,“ in
Journal of Cryptology,
pp.
37
71
22.
D.
Coppersmith
and
P.
Rogaway
, “
A software-optimized encryption algorithm
,” in
Journal of Cryptology,
pp.
273
287
This content is only available via PDF.
You do not currently have access to this content.