SCIRP Mobile Website
Paper Submission

Why Us? >>

  • - Open Access
  • - Peer-reviewed
  • - Rapid publication
  • - Lifetime hosting
  • - Free indexing service
  • - Free promotion service
  • - More citations
  • - Search engine friendly

Free SCIRP Newsletters>>

Add your e-mail address to receive free newsletters from SCIRP.

 

Contact Us >>

Article citations

More>>

Wiener, M.J. (1990) Cryptanalysis of Short RSA Secret Exponents. IEEE Transactions on Information Theory, 36, 553-558.
https://doi.org/10.1109/18.54902

has been cited by the following article:

  • TITLE: A Modified and Secured RSA Public Key Cryptosystem Based on “n” Prime Numbers

    AUTHORS: Muhammad Ariful Islam, Md. Ashraful Islam, Nazrul Islam, Boishakhi Shabnam

    KEYWORDS: RSA Algorithm, Encryption, Decryption, Cryptosystem, Security, Public Key, Private Key

    JOURNAL NAME: Journal of Computer and Communications, Vol.6 No.3, March 23, 2018

    ABSTRACT: Cryptography is the study that provides security service. It concerns with confidentiality, integrity, and authentication. Public key cryptography provides an enormous revolution in the field of the cryptosystem. It uses two different keys where keys are related in such a way that, the public key can use to encrypt the message and private key can be used to decrypt the message. This paper proposed an enhanced and modified approach of RSA cryptosystem based on “n” distinct prime number. This existence of “n” prime number increases the difficulty of the factoring of the variable “N” which increases the complexity of the algorithm. In this approach, two different public key and private key generated from the large factor of the variable “N” and perform a double encryption-decryption operation which affords more security. Experiment on a set of a random number provided that the key generation time, analysis of variable “N”, encryption and decryption will take a long time compared to traditional RSA. Thus, this approach is more efficient, highly secured and not easily breakable.