Preview

Asafsdfadsf

Good Essays
Open Document
Open Document
3457 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Asafsdfadsf
International Journal of Network Security, Vol.10, No.3, PP.216–222, May 2010

216

Evaluating The Performance of Symmetric Encryption Algorithms
Diaa Salama Abd Elminaam1 , Hatem Mohamed Abdual Kader2 , and Mohiy Mohamed Hadhoud2
(Corresponding author: Diaa Salama Abd Elminaam)

Higher Technological Institute 10th of Ramadan City, Egypt1 Faculty of Computers and Information Minufiya University, Egypt2 (Email: {ds desert, hatem6803, mmhadhoud}@yahoo.com (Received Feb. 16, 2009; revised and accepted May 12, 2009)

Abstract

bits keys [2, 3, 4, 5, 9, 10, 11, 13]. The most common classification of encryption techniques can be shown in Internet and networks applications are growing very fast, Figure 1. so the needs to protect such applications are increased. Encryption algorithms play a main role in information security systems. On the other side, those algorithms conCryptography sume a significant amount of computing resources such as CPU time, memory, and battery power. This paper provides evaluation of six of the most common encryption Protocols Public-key Private-key algorithms namely: AES (Rijndael), DES, 3DES, RC2, Blowfish, and RC6. A comparison has been conducted for those encryption algorithms at different settings for RSA& Others each algorithm such as different sizes of data blocks, difBlock Stream ferent data types, battery power consumption, different key size and finally encryption/decryption speed. Experimental results are given to demonstrate the effectiveness RC4& Others of each algorithm. AES BlowFish &Others RC6 Keywords: 3DES, AES, blowfish, computer security, DES, encryption techniques, RC2, RC6 Figure 1: Overview of the field of cryptography

1

Introduction

Many encryption algorithms are widely available and used in information security. They can be categorized into Symmetric (private) and Asymmetric (public) keys encryption. In Symmetric keys encryption or secret key encryption, only one key is used to encrypt and decrypt data. In



References: [1] R. Chandramouli, “Battery power-aware encryption,” ACM Transactions on Information and System Security (TISSEC), vol. 9, no. 2, pp. 162-180, May 2006. [2] D. Coppersmith, “The data encryption standard (DES) and its strength against attacks,” IBM Journal of Research and Development, pp. 243 -250, May 1994. [3] J. Daemen, and V. Rijmen, “Rijndael: The advanced encryption standard,” Dr. Dobb’s Journal, pp. 137139, Mar. 2001. [4] N. E. Fishawy, “Quality of encryption measurement of bitmap images with RC6, MRC6, and rijndael block cipher algorithms,” International Journal of Network Security, pp. 241-251, Nov. 2007. [5] Hardjono, Security In Wireless LANS And MANS, Artech House Publishers, 2005. [6] S. Hirani, Energy Consumption of Encryption Schemes in Wireless Devices Thesis, University of Pittsburgh, Apr. 9,2003, Retrieved Oct. 1, 2008. (http://portal.acm.org/citation.cfm?id=383768) Figure 15: Time consumption for different key size for RC6 International Journal of Network Security, Vol.10, No.3, PP.216–222, May 2010 222 [7] S. Z. S. Idrus, and S. A. Aljunid, “Performance analysis of encryption algorithms text length size on web browsers,” IJCSNS International Journal of Computer Science and Network Security, vol. 8, no.1, pp. 20-25, Jan. 2008. [8] K. McKay, Trade-offs between Energy and Security in Wireless Networks Thesis, Worcester Polytechnic Institute, Apr. 2005. [9] K. Naik, “Software implementation strategies for power-conscious systems,” Mobile Networks and Applications, vol. 6, pp. 291-305, 2001. [10] P. Ruangchaijatupon, and P. Krishnamurthy, “Encryption and power consumption in wireless LANsN,” The Third IEEE Workshop on Wireless LANs, pp. 148-152, Newton, Massachusetts, Sep. 27-28, 2001. [11] B. Schneier, The Blowfish Encryption Algorithm, Retrieved Oct. 25, 2008. (http://www. schneier.com/blowfish.html) [12] A. Sinha, A. P. Chandrakasan, and JouleTrack, “A web based tool for software energy profiling,” Proceedings of the 38th Design Utomation Conference, pp. 220-225, DAC Las Vega, US, 2001. [13] W. Stallings, Cryptography and Network Security, Prentice Hall, pp. 58-309, 4th Ed, 2005. [14] A. A. Tamimi, Performance Analysis of Data Encryption Algorithms, Retrieved Oct. 1, 2008. (http://www.cs.wustl.edu/∼jain/cse567-06/ftp/ encryption perf/index.html) [15] A. Nadeem, “A performance comparison of data encryption algorithms,” IEEE Information and Communication Technologies, pp. 84-89, 2006. [16] Results of Comparing Tens of Encryption Algorithms Using Different Settings- Crypto++ Benchmark, Retrieved Oct. 1, 2008. (http://www.eskimo.com/ weidai/benchmarks.html) Diaa Salama Abd Elminaam was born on November 23, 1982 in Kafr Sakr, Sharkia, Egypt. He received the B.S from Faculty of Computers &Informatics, Zagazig University, Egypt in 2004 with grade very good with honor, and obtains master degree in information system from faculty of computers and information, menufia university, Egypt in 2009. He is working in Higher Technological Institute, 10th of Ramadan city as teaching assistance at Faculty of Computer and informatics. He majors in Cryptography and Network Security. (Mobile: +20166104747; e-mail:ds desert@yahoo.com) Dr. H. M. Abdul-kader obtained his B. S. and M. SC. (by research) both in Electrical Engineering from the Alexandria University, Faculty of Engineering, Egypt in 1990 and 1995 respectively. He obtained his Ph.D. degree in Electrical Engineering also from Alexandria University, Faculty of Engineering, and Egypt in 2001 specializing in neural networks and applications. He is currently a Lecturer in Information systems department, Faculty of Computers and Information, Menoufya University, Egypt since 2004. He has worked on a number of research topics and consulted for a number of organizations. He has contributed more than 30+ technical papers in the areas of neural networks, Database applications, Information security and Internet applications. Professor Mohiy Mohamed Hadhoud, Dean, Faculty of Computers and Information, head of Information Technology Department, Menoufia University, Shebin Elkom, Egypt. He is a member of National Computers and Informatics Sector Planning committee, University training supervisor. He graduated, from the department of Electronics and Computer Science, Southampton University, UK, 1987. Since 2001 till now he is working as a Professor of Multimedia, Signals and image processing and Head of the department of Information Technology (IT), He was nominated by the university council for the national supremacy award, years 2003, and 2004. He is the recipient of the university supremacy award for the year 2007. He, among others are the recipient of the Most cited paper award form the Digital signal processing journal, Vol. 18, No. 4, July 2008, pp. 677-678. ELSEVIER Publisher. Prof. Hadhoud has published more than 110 papers in international journals, international conferences, local journals and local conferences. His fields of Interest: Digital Signal Processing, 2-D Adaptive filtering, Digital Image Processing, Digital communications, Multimedia applications, and Information security and data hiding.

You May Also Find These Documents Helpful

  • Good Essays

    A secure and efficient protocol is used, ECC elliptic curve cryptography a public key cryptography…

    • 470 Words
    • 2 Pages
    Good Essays
  • Good Essays

    NETWORKING ADMIN

    • 606 Words
    • 3 Pages

    Match common encryption algorithms and methods with the scenarios representing real-world business applications and requirements.…

    • 606 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Match common encryption algorithms and methods with the scenarios representing real-world business applications and requirements.…

    • 406 Words
    • 2 Pages
    Good Essays
  • Good Essays

    Lab #3

    • 517 Words
    • 3 Pages

    This lab demonstrated how hashing tools can be used to ensure message and file transfer integrity and how encryption can be used to maximize confidentiality. Common hashing and encryption tools, including MD5, SHA1, and GnuPG, were used. You used GnuPG to generate both a public and private key and a secret key for encryption only.…

    • 517 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    Kendall, J., Dr. (2008, June). Cryptographic Techniques for Network Security. University of Portsmouth. Retrieved from https://learn.umuc.edu/d2l/le/content/57178/viewContent/2562147/View.…

    • 1135 Words
    • 4 Pages
    Powerful Essays
  • Good Essays

    WFV1 Notes

    • 4474 Words
    • 16 Pages

    Symmetric/ asymertric encryption Network Technology Associate v2.0, Lesson 6: Network and Cloud Security Risks, section "Encryption.”…

    • 4474 Words
    • 16 Pages
    Good Essays
  • Powerful Essays

    They are numerous protocols and standards that are used for communications over networks. But only a few protocols are cryptographic in nature. Cryptographic protocols provide secure communication between two communicating entities over the insecure network. Cryptographic protocols use either symmetric or asymmetric or a combination of both the algorithm to secure the communication channel. Presented in this paper are various cryptographic protocols that provide encryption to data in transit.…

    • 2890 Words
    • 12 Pages
    Powerful Essays
  • Good Essays

    Cryptography

    • 385 Words
    • 2 Pages

    Data Encryption Standard (DES), ROT13, and Enigma are all examples of algorithm for the encryption of electronic data…

    • 385 Words
    • 2 Pages
    Good Essays
  • Good Essays

    At ABC Institute of Research, the value of the company is in the confidentiality of what it finds. If for example, ABC were to expend a great investment in finding a solution to a problem, only for DEF Research Inc. to discover their secret, ABC could suffer greatly. In the current age of networks and computers, the information you put in is only as safe as you make it. In order for ABC Institute of Research to keep their investment safe, they must protect their data at all costs. In the following, I will show how ABC can accomplish this using asymmetric cryptology to exchange a secret key and then use symmetric cryptology to ensure the confidentiality of data being sent; I will then show you the advantages and disadvantages.…

    • 560 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    Public Key Infrastructure

    • 2320 Words
    • 10 Pages

    This paper is intended to show the importance using a Public Key Infrastructure (PKI). PKI is a broad subject matter and is constantly evolving to meet the growing demands of the business world. This paper will address PKI at a relatively high-level and will not include details regarding the underlying cryptography (Weise, 2001). This paper will cover the history behind PKI, why we should us PKI, its purposes and functions how PKI works.…

    • 2320 Words
    • 10 Pages
    Powerful Essays
  • Powerful Essays

    The concepts of wireless network security consist of commitment of cyber security and maintaining security based on the latest development and exploits against the network K.W. Ross, J. K. (2012). Wireless Network Security is based on the principles of cryptography, message integrity, authentication, securing e-mails, securing TCP connections: SSL, securing Network layer: IPsec, securing wirelsess: LANs, securing the operational security structure, such as the firewalls and the IDS K.W. Ross, J. K. (2012). This security measure would cover the detection of intrusions, unauthorized usage, authentication, hashing, digital certification, updated security software, network security, hacking prevention, phishing prevention and encryption K.W. Ross, J. K. (2012). There are many risks, threats, and vulnerabilities with online access and usage of the internet, regardless if wired or wireless and all should be secured. Wireless devices communicate through radio without a connection to anything physical Radack, S. (n.d.). The wireless device may be a cell phone, laptop, local area network, remote controls, stereos, personal network, microphones, a headphone, IPad, IPod, etc. It is important to secure the access points because the system may be compromised by unauthorized persons for theft, or other risk factors. The internet could be used by someone unknown, without the user’s permission or knowledge and simply to commit crimes using the user’s credentials. This report will show the importance of securing a wireless system and why it is important.…

    • 1936 Words
    • 8 Pages
    Powerful Essays
  • Powerful Essays

    Network Security Concepts

    • 1883 Words
    • 8 Pages

    Convery, S. (2004, June 18). General design considerations for secure networks. Retrieved on November 2, 2005 from http://www.ciscopress.com/…

    • 1883 Words
    • 8 Pages
    Powerful Essays
  • Good Essays

    INTRODUCTION: Blowfish, a symmetric block cipher developed by Bruce Schneier[SCHN93, SCHN94), is a Feistel network, iterating simple encryption and decryption functions of 16 times each. The block size is 64 bits, and the key can be any length up to 448 bits. Although there is a complex initialization phase required before any encryption can take place, the actual encryption of data is very efficient on large microprocessors. Blowfish was designed to have the following characteristics: Fast: Blowfish encrypts data on 32-bit microprocessors at a rate of 18 clock cycles per byte. Compact: Blowfish can run in less than 5K of memory. Simple: Blowfish's simple structure is easy to implement and eases the task of determining the strength of the algorithm. Variably secure: The key length is variable and can be as long as 448 bits. This allows a tradeoff between higher speed and higher security. Blowfish encrypts 64-bit blocks of plaintext into 64-bit blocks of ciphertext. Blowfish is implemented in numerous products and has received a fair amount of scrutiny. So far, the security of Blowfish is unchallenged. DESIGN DECISIONS Based on Schneier's design parameters, he have made these design decisions. The algorithm should: - Manipulate data in large blocks, preferably 32 bits in size (and not in single bits, such as DES). - Have either a 64-bit or a 128-bit block size. - Have a scalable key, from 32 bits to at least 256 bits. - Use simple operations that are efficient on microprocessors: e.g., exclusiveor, addition, table lookup, modular- multiplication. It should not use variablelength shifts or bit-wise permutations, or conditional jumps. - Be implementable on an 8-bit processor with a minimum of 24 bytes of RAM (in addition to the RAM required to store the key) and 1 kilobyte of ROM. - Employ precomputable subkeys. On large-memory systems, these subkeys can be precomputed for faster operation. Not precomputing the subkeys will result in…

    • 607 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Aes Encrypt

    • 1445 Words
    • 6 Pages

    private key symmetric block cipher 128-bit data, 128/192/256-bit keys stronger & faster than Triple-DES active life of 20-30 years (+ archival use) provide full specification & design details both C & Java implementations NIST have released all submissions & unclassified analyses…

    • 1445 Words
    • 6 Pages
    Good Essays
  • Powerful Essays

    Asymmetric Encryption

    • 6805 Words
    • 28 Pages

    When public key cryptography was invented, one o i su e w si e t f e a t es c r t a s o to f t ss a dniid s h eue rnpr f secret symmetric keys. The objectives of such a key transport mechanism keep evolving as attacks are identified, hidden assumptions are revealed, proofs of security are given, and additional capability is nee.Tepoescniusi ti atce edd h rcs otne n hs ril. W e trace the evolution of some asymmetric key transport mechanisms, starting with the method in PKCS #1 [10]. We t e d s u s i h s o i a o d r, hn ics, n itrcl re two masking techniques developed by IBM cryptographers, and the method currently under study in ANSI draft standard X9.44 RSA Key Tr n p r . asot W e then give ideas that may be useful when using elliptic curve cryptography, where t e s z o t e h ie f h block is typically much less than that used with other algorithms, for example, RSA. W e w l u e t e f l o i g t rminology: il s h olwn e Formatted block — a b o k o d t p s e a i p t lc f aa asd s nu t temtos I cnan asc o h e h d . t o t i s e ret symmetric key…

    • 6805 Words
    • 28 Pages
    Powerful Essays