An efficient decryption method for RSA cryptosystem

@article{Hwang2005AnED,
  title={An efficient decryption method for RSA cryptosystem},
  author={Ren-Junn Hwang and Feng-Fu Su and Yi-Shiung Yeh and Chia-Yao Chen},
  journal={19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers)},
  year={2005},
  volume={1},
  pages={585-590 vol.1}
}
This paper proposes an efficient method to implement RSA decryption algorithm. RSA cryptosystem is the most attractive and popular security technique for many applications, such as electronic commerce and secure Internet access. It has to perform modular exponentiation with large exponent and modulus for security consideration. The RSA cryptosystem takes great computational cost. In many RSA applications, user uses a small public key to speed up the encryption operation. However, the decryption… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Efficient Method for Generating Strong Primes with Constraint of Bit Length

  • C.-S. Lai, W.-C. Yang, C.-H. Chen
  • Electronics Letters,
  • 1991
2 Excerpts

A Method for Generating Cryptographically Strong Primes

  • M. Ogiwara
  • IEICE Trans.,
  • 1990
3 Excerpts

Note on the generation of P0 for RSA keysets

  • M. J. Ganley
  • Electronics Letters,
  • 1990
2 Excerpts

Strong RSA Keys

  • J. Gordon
  • Electronics Letters,
  • 1984
2 Excerpts

Fast decipherment algorithm for RSA public-key cryptosystem

  • J.-J. Quisquater, C. Couvreur
  • Electronics Letters 18,
  • 1982
1 Excerpt

Similar Papers

Loading similar papers…