Call for Paper - January 2022 Edition
IJCA solicits original research papers for the January 2022 Edition. Last date of manuscript submission is December 20, 2021. Read More

Encryption and Decryption through RSA Cryptosystem using Two Public Keys and Chinese Remainder Theorem

Print
PDF
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2017
Authors:
Aarushi Rai, Shitanshu Jain
10.5120/ijca2017914674

Aarushi Rai and Shitanshu Jain. Encryption and Decryption through RSA Cryptosystem using Two Public Keys and Chinese Remainder Theorem. International Journal of Computer Applications 170(1):40-43, July 2017. BibTeX

@article{10.5120/ijca2017914674,
	author = {Aarushi Rai and Shitanshu Jain},
	title = {Encryption and Decryption through RSA Cryptosystem using Two Public Keys and Chinese Remainder Theorem},
	journal = {International Journal of Computer Applications},
	issue_date = {July 2017},
	volume = {170},
	number = {1},
	month = {Jul},
	year = {2017},
	issn = {0975-8887},
	pages = {40-43},
	numpages = {4},
	url = {http://www.ijcaonline.org/archives/volume170/number1/28038-2017914674},
	doi = {10.5120/ijca2017914674},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}
}

Abstract

Network security refers to an activity which is designed to protect the usability and integrity of the network and data. In network security, cryptography is the branch in which one can store and transmit data in a particular format so that only the intended user can read and process it, RSA algorithm is an asymmetric cryptography technique, which works on two keys i.e. public key and private key. The proposed method takes four prime numbers in RSA algorithm. Instead of sending public key directly, two positive integers are used, on which some mathematical calculation is done. And by using those integers two public keys would be sent to the user. The scheme has speed enhancement on RSA decryption side by using Chinese remainder theorem. So that the algorithm overcomes several attacks which are possible on RSA.

References

  1. T.R. Devi, “Importance of cryptography in network security” IEEE International Conference, Communication System and network Technologies (CSNT), 2013
  2. William Stein, elementary Number Theory, Primes Congruences and Secrets. January 23, 2017
  3. Number theory concepts and Chinese remainder theorem: “https://crypto.stanford.edu/pbc/notes/numbertheory/crt.html.”
  4. Saurbh Singh and Gaurav Agarwal, “Use of Chinese Remainder theorem to generate radom numbers for cryptography” Research article in international journal of applied engineering research, DINDIGUL. ISSN- 0976-4259
  5. R. Rivest, A. Shamir and L. Adleman, "A Method for Obtaining Digital Signature and Public-key Cryptosystems," Communications of the ACM, vol. 21, no. 2, pp. 120-126, 1978.
  6. G. R. Blakey, "A Computer Algorithm for Calculating the Product AB Modulo M," IEEE Transaction on Computers, vol. 32, no. 5, pp. 497-500, 1983.
  7. Network security Concepts, “http://williamstallings.com/Extras/Security-Notes/lectures/publickey.html
  8. P.C. Kocher, “Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other Systems” Advances in cryptography- CRYPTO ’96, pp. 104-113, 1996.
  9. Celine Blondeau and Kaisa Nyberg, “On Distinct Known Plaintext Attacks”, Aalto University Finland, WCC_2015
  10. Israt Jahan, Mohammad Asif, Liton Jude Rozario “ Improved RSA cryptosystem based on the study of the number theory and public key cryptosystems” volume-4 Issue-1, pp-143-149.
  11. RSA Algorithm in Cryptography http://www.geeksforgeeks.org/rsa-algorithm-cryptography/
  12. Nikita Somani, Dharmendra Mangal, “ An improved RSA cryptographic System”. International Journal of Computer Applications (0975-8887) volume 105-No. 16 November 2014.
  13. Chinese remainder theorem and proof https://brilliant.org/wiki/chinese-remainder-theorem/

Keywords

RSA, Cryptography, Network Security.