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

Three Prime RSA Algorithm Using Randomly Generated Prime Sequence Cryptosystem

Author

Listed:
  • Pooja Devi
  • Naveen Tyagi
  • Parul Saharavat

Abstract

Existing RSA cryptosystem is not in used due to the fact that it is very slow in process and also having the problem of Brute force and factorization attack. Hence these factors can degrade the performance of the RSA cryptosystem. Therefore a concept is needed which can overcome these entire factor. Hence we proposed algorithm we use the hybrid combination of the subset sum problem and modified RSA cryptosystem. In this work, we are going to enhance the security of the RSA algorithm. Here we are using three prime numbers in place of two and also adding super increasing sequence for the key generation process. If Attacker wants to break proposed systems then one has to factor the modulus into its primes as well as find the secret set A. If modified RSA, which is based on single module is broken in time x and subset sum algorithm is broken in time y then the time required to break this proposed algorithm is x*y. Therefore the security of our proposed system is increased as compared to RSA algorithm.

Suggested Citation

  • Pooja Devi & Naveen Tyagi & Parul Saharavat, 2018. "Three Prime RSA Algorithm Using Randomly Generated Prime Sequence Cryptosystem," 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(6), pages 48-52, July.
    • Handle: RePEc:jbh:ijsrcs:v3:y2018:i6:id:hcseit183613
    Note: Article URL: https://ijsrcseit.com/CSEIT183613
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT183613
    File Function: Article URL
    Download Restriction: no
    File URL: https://ijsrcseit.com/paper/CSEIT183613.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:i6:id:hcseit183613. 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 (USA) (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.