IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v3y2018i4idhcseit1833191.html

Comparison of Time Complexity of Symmetric and Asymmetric Key Cryptographic Algorithms

Author

Listed:
  • J P Patra
  • Bhumika Joshi
  • Snigdha Chowdhury

Abstract

Information security is the most important as well as the most challenging aspect when considered for internet and network applications. Since internet and network applications are growing very fast so it has become very important to provide necessary protection to the data against the attackers and that too in time. The intruders may use the data being sent for fraudulent purposes. So in order to reduce data loss and pilfering, data privacy requires more attention. Cryptography is one of the popular means of protecting information in order to achieve confidentiality, integrity, authentication, non-repudiation, access control and availability. Cryptography is a main aspect of computer security that converts data from its actual form into an unreadable form. The two main characteristics that identify and differentiate one algorithm from another are its ability to secure the protected data against attacks and its speed and efficiency in doing so. The two widely accepted and used categories of cryptographic algorithms to protect information using the desired key are symmetric and asymmetric. Asymmetric algorithms have been analyzed by researchers to be stronger compared to Symmetric algorithms but has higher time complexity. AES belongs to the category of symmetric key cryptography and RSA belongs to the category of asymmetric key cryptography. This paper comprises of brief description of AES and RSA cryptographic algorithms. Also a theoretical as well as a practical performance analysis and comparison of symmetric and asymmetric cryptography has been provided. The comparison is made on the basis of speed, key size and time complexity. A website has been developed using Bootstrap and PHP to execute the codes.

Suggested Citation

  • J P Patra & Bhumika Joshi & Snigdha Chowdhury, 2018. "Comparison of Time Complexity of Symmetric and Asymmetric Key Cryptographic Algorithms," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 3(4), pages 162-166, April.
  • Handle: RePEc:jbh:ijsrcs:v3:y2018:i4:id:hcseit1833191
    Note: Article URL: https://ijsrcseit.com/CSEIT1833191
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT1833191
    File Function: Article URL
    Download Restriction: no

    File URL: https://ijsrcseit.com/paper/CSEIT1833191.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jbh:ijsrcs:v3:y2018:i4:id:hcseit1833191. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (email available below). General contact details of provider: https://ijsrcseit.com/home .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.