International Journal of Networks and Communications

p-ISSN: 2168-4936    e-ISSN: 2168-4944

2011;  1(1): 14-17

doi: 10.5923/j.ijnc.20110101.03

A Research on Performance Evaluation for Some Cipher Models Based on Analytical Survey

Raj Kumar , V. K. Saraswat

Department of Computer Science, ICIS, Dr. B.R. Ambedkar University, Agra

Correspondence to: V. K. Saraswat , Department of Computer Science, ICIS, Dr. B.R. Ambedkar University, Agra.

Email:

Copyright © 2012 Scientific & Academic Publishing. All Rights Reserved.

Abstract

Cryptography is the fundamental building block for designing the speedy and reliable cypto-system. These are several mathematical functions like modulus, hash and exponent to be sued in different crypto-algorithum. Security level of a cipher depends on its key size, key selection and key management. Inventors have developed many cryptosystems called cipher to be used in software and hardware level security devices. The present paper focuses the characteristics and performance related issues for several symmetric and asymmetric ciphers.

Keywords: Encipher, Decipher, Cryptosystem, Block Cipher, Stream Cipher, Public Key, Private Key

Cite this paper: Raj Kumar , V. K. Saraswat , "A Research on Performance Evaluation for Some Cipher Models Based on Analytical Survey", International Journal of Networks and Communications, Vol. 1 No. 1, 2011, pp. 14-17. doi: 10.5923/j.ijnc.20110101.03.

1. Introduction

Cryptography is an effective way of protecting sensitive information transmitted through computer networks[1]. It is an art of hiding information by encoding it into unreadable formats. The main goal of cryptosystem is to prevent un-authorized access of information by adopting non- breakable algorithms[2,5]. The information can only be revealed if the attacker has enough time, desire and resources. Thus the cryptosystem makes obtaining the information too work insensitive to be worth it to the attacker. The analytical criteria's of the cryptography is confidentiality, data integrity, authentication and non-repudiation[3,8].
Confidentiality is the feature of secrecy made for the information. It ensures that any un-authorized parties cannot access the information. It also guaranties for physical and logical protection of data[4].
Data integrity provide assurance from manipulation during transmission, accidentally or intentionally[7].
Authentication is related with validity of identified parties entering into a communication[6]. Non-repudiation ensures that sender and receiver cannot deny from their actions[5,11]. This procedure protect from denial of the activities made by sender or receiver.
Cryptography has a long and fascinating history proliferation of computers and communication system has brought it with a demand to protect information in "digital age"[9]. Such algorithms are called ciphers. In this paper we have done the analytical survey of the block ciphers and stream ciphers. Further a report on competitive performance has been layout for both the symmetric and asymmetric cryptographic systems[10].

2. Organization

In section 3, if have depicted the basics of cryptography. The task of en-cipher and de-cipher has been introduced.
In section 4, we have analyzed the survey result of the various cipher models symmetric, as well as asymmetric consisting block and stream ciphers both.
Finally in section 5, we have presented our views and the conclusion for the performance evaluation of the cipher models.

3. Basics of Cryptography

Figure 3.1. Encipher Process.
Figure 3.2. Decipher process.
Figure 3.3. Configuration of a cryptosystem.
Cryptography is the method of conversion of the plaintext (original data) into cipher text (unreadable data). The process of encryption transforms plain text into cipher text whether the process of decryption transforms cipher text into plain text.
The cryptographic systems work on two mode i.e. bit by bit mode which is called stream cipher and another where a group of character by a char mode which is called block cipher[15,18].
In block cipher algorithms, message is divided into blocks and mathematical functions are performed (like substitution, transposition, transformation) to encrypt and decrypt these blocks[13,14].
Stream cipher encrypts and decrypts data on bit or byte at a time. It is most suitable for chip level or hardware implementations[12,16].
Figure 3.4. Model of a block cipher.
Figure 3.5. Model of a Stream Cipher.

4. Survey on Cryptographic System

A cryptographic system recognized by its way of performing encryption/decryption. Modern cryptographic systems are classified as symmetric and asymmetric cryptosystem[17]. A symmetric cryptosystem use the same key to encrypt and decrypt the message, whether in asymmetric cryptosystem encryption and decryption is by using public and private key[18,20,21].
Following table enumerates the difference characteristics between symmetric as asymmetric system.

4.1. Symmetric Cryptosystems

It is the mechanism of cryptography based on only single key called "secret key" for encryption and decryption[19,23].
We are analyzing the following symmetric block cipher algorithms[24,25].
Ÿ MARS : Developed by the IBM team who have developed DES and Lucipher in 1974.
Ÿ RC6 : Recent code 6 developed by RSA laboratory.
Ÿ Serpent : It is developed by Ross Anderson Eli Biham and Lars Knudsen.
Ÿ Twofish : Developed by counterpane systems.
Ÿ Rijndael : Developed by Joan Daemon and Vincent Rijmen.
We can conclude the superiority of Rijndael algorithm in the comparative analysis of various symmetric block ciphers.
Following are the tables to demonstrate the performance of ciphers.
Table 4.11. Encryption/Decryption performance.
32 bit (C)32 bit Java64 bit C and Assembly8 bit C and Assembly
MARS++++++++
RC6++++++++++
RIJNDAEL++++++++++
SERPENT++++
TWOFISH+++++++
Table 4.12. Key Setup performance.
32 bit (C)32 bit Java64 bit C and Assembly8 bit C and Assembly
MARS+++++++
RC6+++++++
RIJNDAEL++++++++++++
SERPENT++++++
TWOFISH+++++

4.2. Asymmetric Cryptosystem

In this cryptosystem different key is used to encrypt a message than the key that is used to decrypt the message.
We are analyzing the following asymmetric cryptosystem[24,28].
Ÿ RSA : It is invented by Ron Rivest, Adi Shamir and Leonard Adleman.
Ÿ ECC : Elliptic curve cryptosystem is useful for limited source devices.
Ÿ ECRYPT : A Prominent cryptosystem like RSA.
Ÿ HASH : A mathematical function based cryptosystem.
Ÿ DSAsg : Cryptosystem used in designing digital signatures and certificates.
Following table depicts the key length comparison for the security of various asymmetric cryptosystem over time of development in digital era[26,27].
Table 4.21. Key length Vs Security.
YearEncryptHASHRSADSAsgECC
2002721441028127135
2005741481149131139
2010781561369138146
2015821641613145154
2020861721882151160

5. Conclusions

Among the various models of symmetric cipher analyzed the Rijndael is the best. Actually it is the role model of DES and AES. This model is adopted by different information security agencies like NSA, NIST and FIPS[30].
Among the various asymmetric cipher RSA is a moderate and most useful cipher for small data encryption like digital signature, ATM Pin etc.[24].
But RSA is much slower than Rijndael and other symmetric cipher[14].
The symmetric cipher like Rijndael is support to be secure against mathematical attacks until 2090[15]. Thus they are very suitable for hardware level security in communicating devices.

References

[1]  D. Kahn, Codebreakers: The Story of Secret Writing, Macmillan, 1967
[2]  H. Feistel, "Cryptographic coding for data bank privacy," IBM Corp. Res. Rep. RC 2827, Mar. 1970. (I-B4, III-B, SFR)
[3]  Diffie, W. & Hellman, M. E. (1976), ‘New directions in cryptography’, IEEE Trans. Inform. Theory IT-22 (6) 644–654
[4]  Signatures and Public-Key Cryptosystems”, Communications of the ACM 21,2 (Feb. 1978), 120-126
[5]  T. El Gamal. A public key cryptosystem and signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory, 31:469--472, 1985
[6]  National Institute of Standards and Technology, NST FIPS PUB 186, Digital Signature Standard, U.S. Department of Commerce, May, 1994
[7]  J. Nechvatal, E. Barker, L. Bassham, W. Burr, M. Dworkin, J. Foti and E.Roback, “Report on the Development of the Advanced Encryption Standard (AES)” , Journal of Research of the National Institute of Standards and Technology, 2000,Volume 106, pp. 511–576
[8]  Dworkin, M., "Recommendation for Block Cipher Modes of Operation - Methods and Techniques", NIST Special Publication 800-38A, December 2001
[9]  CNSS Policy No. 15, Fact Sheet No. 1, National Policy on the Use of the Advanced Encryption Standard (AES) to Protect National Security Systems and National Security Information , June 2003
[10]  N. Ferguson, R. Schroeppel, D. Whiting, “A simple algebraic representation of Rijndael “, Selected Areas in Cryptography, Proc. SAC 2001, Lecture Notes in Computer Science 2259, pp. 103–111, Springer Verlag, 2001
[11]  K. Aoki and H. Lipmaa, “Fast Implementations of AES Candidates”, Third Advanced Encryption Standard Candidate Conference, 2000, pages 106–120
[12]  H. Lipmaa, Fast Implementations of AES and IDEA fro Pentium 3 and 4, October 2005, http://home.cyber.ee/helger/ implementations
[13]  A. Hodjat, I. Verbauwhede, “A 21.54 Gbit/s fully pipelined AES processor on FPGA”, Field–Programmable Custom Computing Machines 2004 (FCCM’04), 12th Annual IEEE Symposium, pages 308 – 309
[14]  B. Schneier, J. Kelsey, D. Whiting, D. Wagner, C. Hall and N. Ferguson, “Performance Comparison of the AES Submissions”, Proc. Second AES Candidate Conference, NIST, 1999, pp. 15-34
[15]  A. Lenstra, Key Length, Contribution to “The Handbook of Information Security”, 2004, http://cm.bell-labs.com/who/akl/key_lengths.pdf
[16]  ECRYPT Yearly Report on Algorithms and Keysizes 2005, http://www.ecrypt.eu.org/documents/D.SPA.16- 1.0.pdf
[17]  J. Buchmann, Einf¨uhrung in die Kryptographie, Springer, 2001, ISBN: 3-540-41283-2, also available in English ISBN: 0-387-21156-X
[18]  K. Aoki et., al. “Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms- Design and Analysis”, Selected Areas in Cryptography 2000, pp39–56
[19]  Matsui, M., Nakajima, J., and S. Moriai, "A Description of the Camellia Encryption Algorithm", RFC 3713, April 2004
[20]  NIST, FIPS PUB 197, "Advanced Encryption Standard (AES)," November 2001.http://csrc.nist.gov/publications /fips/fips197/fips-197
[21]  Frankel, S., Glenn, R., and S. Kelly, "The AESCBC Cipher Algorithm and Its Use With IPsec," RFC 3602, September 2003
[22]  A. Lenstra, Unbelievable Security, 2001, http://www.win. tue.nl /~klenstra/aes_match.pdf
[23]  The NESSIE project (New European Schemes for Signatures, Integrity and Encryption), http://www.cosic.esat. kuleuven.ac.be/nessie/
[24]  NIST Computer Security Division, http://csrc.nist.gov/
[25]  Arjen Lenstra and E. Verheul, ”Selecting Cryptographic Key Sizes”, 2001, http://citeseer.ist.psu.edu/287428.html
[26]  RSA Security, PKCS #1: RSA Cryptography Standard, http://www.rsasecurity.com/rsalabs/node.asp?id=2125
[27]  Ilya Mironov Microsoft Research, Silicon Valley Campus mironov@microsoft.com November 14, 2005
[28]  www.nsa.gov
[29]  www.iacr.org
[30]  www.ipa.go.jp/security