Optimization of RSA Algorithm by using Binary Method

Authors

  • Raushan Kumar Singh Dept. of Information Technology, MKRECIT Ambedkar Nagar, Uttar Pradesh
  • Shobhit Kumar Dept. of Information Technology, MKRECIT Ambedkar Nagar, Uttar Pradesh

Keywords:

RSA algorithm, Key generation Encryption, Decryption, Modular Exponentiation, Binary Method

Abstract

This paper proposes a calculation method for the improvement of RSA algorithm which reduces the issues of scalability, flexibility and performance. This paper will be based on the mathematical function used in the RSA algorithm and reduces the number of steps for calculating the value of Md. The proposed method improves the calculation performance of the RSA to make it useful in providing security to every known application.

References

“A method for obtaining Digital Signature and Public key crypto system” by R.Rivest, A.Shamir, and adleman.

“Data security in cloud computing using RSA Algorithm”, International Journal of Research in Computer and Technology, IJRCCT, Parsi kalpna et. Al, ISSN 2278-5841, vol1, issue 4, September 2012.

“Cryptography and Network Security” principle and practices fourth edition, 2006, Page no. 306-366.

“A study on Improvement in RSA Algorithm and its implementation”, International Journal of Research in Computer and Technology, IJRCCT, P Saveetha & S. Arumugam, ISSN volume-3 2012.

“High Speed RSA Implementation”Cetin Kaya Koc, RSA Laboratories, version-2.0 Nov 1994.

“The Art of computer programming: seminumerical Algorithms”, D.E Knuth, volume-2 second Edition 1981.

Downloads

Published

2014-06-30

How to Cite

[1]
R. K. Singh and S. Kumar, “Optimization of RSA Algorithm by using Binary Method”, Int. J. Comp. Sci. Eng., vol. 2, no. 6, pp. 25–27, Jun. 2014.

Issue

Section

Research Article