Call For Papers
Contact Us

  A Literature Survey on Efficiency and Security of Symmetric Cryptography  
  Authors : Mayank Kumar Rusia; Mohit Rusia
  Cite as:


Data encryption is widely used to assure security in open networks such as the internet. Each kind of data has its own features; therefore, different techniques should be used to protect confidential data from unauthorized access. Currently, most of the available encryption algorithms are used for text data. However, due to large data size and real time constrains, algorithms that are good for textual data may not be suitable for multimedia data. This Paper is a literature survey about block ciphers encryption algorithm( triple-DES, DES,AES, Blow-Fish).In this Paper I have concentrates on providing a starting point for designing strong, secure, and efficient cryptosystems. Various design issues and algorithms have been described in the paper. Paper explains a new timing evaluation model based on random number generating mechanism is proposed here to analyze the time-consuming of the known block cipher symmetric cryptographic algorithms. In this model for evaluation, there is one evaluating mode, which is different plaintexts in the same key (DPSK). As the basis of the evaluating model, the plaintext and the corresponding key, both generated by random numbers. The theoretical results shows that under the same key length and for the same size of the processed data, Triple- DES is about several hundred times slower than our proposed working model, AES, DES, Blow-Fish and IDEA. And there are other runtime characteristics which further highlight the difference between these three cryptographic algorithms and provide a reference value of for people’s rational using.


Published In : IJCSN Journal Volume 6, Issue 3

Date of Publication : June 2017

Pages : 425-429

Figures :02

Tables : --


Mayank Kumar Rusia : holds Master of Technology degree specialization in Artificial Intelligence in the Department of Information Technology awarded in the year 2011. He has done Bachelor of Engineering in Information Technology, awarded in the year 2005. The author is presently working as a Lecturer (Senior Scale), being the in-charge Head of Department for Computer Science and Engineering Department at S.R. Government Polytechnic College, Sagar, Madhya Pradesh, governed by Directorate of Technical Education, Government of Madhya Pradesh, India.

Mohit Rusia : being the Master of Engineer in Information Security in the branch of Information Technology awarded in the year 2014 and Bachelor of Engineer in Computer Science and Engineering stream, awarded in year 2012, works in a MNC as a Senior Information Security Analyst at National Capital Region, New Delhi, India.


Time-Consuming; Triple-DES; AES; Blow-Fish; IDEA; Random Number.

That is what most theoretical analysis cannot achieve, even though quite familiar with the algorithm. When the number of the evaluated plaintexts is bigger, their effect is more obvious. Finally, it is not difficult to find that, in contrast with training data, the larger the key length is, the bigger AVT is, especially for Triple-DES. This is also indicating that Blow-Fish is the most effective algorithm except proposed working model due to fixed key size and the value of MAX or MIN is not the same in evaluation mode. Besides, in contrast with training data, it is not difficult to find that the increasing key length can lead to the significant increment of AVT. In fact, different value of MAX and MIN further manifest that not only the resulting cipher text depends on the key; the content of key also effects the time consuming of algorithm.


[1] Onwutalobi Anthony-Claret, “Using Encryption Technique”, Department of Computer Science,University of Wollongong Australia, Anthony.claret@ieee.org [2] Prof. Mrinmoy Ghosh and Prof. Pranam Paul, “An Application to ensure Security through Bit-level Encryption”, IJCSNS International Journal of Computer Science and Network Security, VOL.9 No.11, November 2009. [3] Fauzan Saeed and Mustafa Rashid, “Integrating Classical Encryption with Modern Technique”, IJCSNS International Journal of Computer Science and Network Security, VOL.10 No.5, May 2010. [4] Diaa Salama Abdul. Elminaam, Hatem Mohamed Abdul Kader and Mohie Mohamed Hadhoud, “Performance Evaluation of Symmetric Encryption Algorithms”, IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.12, December 2008. [5] Diaa Salama Abd Elminaam, Hatem Mohamed Abdual Kader, and Mohiy Mohamed Hadhoud, “Evaluating The Performance of Symmetric Encryption Algorithms”, International Journal of Network Security, Vol.10, No.3, PP.213-219, May 2010. [6] Diaa Salama Abdul Minaam, Hatem M. Abdual-Kader, and Mohiy Mohamed Hadhoud, “Evaluating the Effects of Symmetric Cryptography Algorithms on Power Consumption for Different Data Types”, International Journal of Network Security, Vol.11, No.2, PP.78-87, Sept. 2010. [7] William stallings, “Cryptography and Network Security: Principles & Practices”, second edition, [8] Hardjono, ''Security In Wireless LANS And MANS,'' Artech House Publishers, 2005. [9] Yan Wang and Ming Hu, “Timing evaluation of the known cryptographic algorithms”, published in 2009 International Conference on Computational Intelligence and Security978-0-7695-3931-7/09 IEEE DOI 10.1109/CIS .2009.81.