Lightweight Rsa Algorithm Using Three Prime Numbers

  • Authors

    • Mustafa M. Abd Zaid
    • Dr. Soukaena Hassan
    2018-12-09
    https://doi.org/10.14419/ijet.v7i4.36.23790
  • Decryption, encryption, key generation, three prime-RSA algorithm
  • The computing devices utilized as a part of an extensive class of remote correspondence systems, for example, cell phones, remote sensor systems (WSNs), vehicular ad hoc networks (VANETs), mobile ad hoc networks (MANETs), Internet of Things (IoT), body area networks (BANs) and so on, are little and asset compelled. In the current developments of the resource constraint environments, the trend is shifted towards lightweight cryptographic algorithm. Many lightweight cryptographic algorithms have been developed and also existed algorithms are modified in terms of resource constraint environments. One of such new procedures is utilizing three prime numbers for RSA cryptosystem, which is not easily breakable. Our approach using three prime number rather than two prime-dependent systems to get (n) with same length of standard RSA but less bits for prime numbers. The suggested algorithm has speed enhancement on standard RSA key generation side and decryption side by utilizing three primes and the Chinese Reminder Theorem (CRT). The results indicate that the average of speed improvement is ~80% in key generation process, ~96% in decryption process, and only 4% in the encryption process.

     

     

     

  • References

    1. [1] J.Sahu, V.Singh VS and AC. An Enhanced Version of RSA to Increase the Security. J Netw Commun Emerg Technol. 2017;7(4):2395–5317.

      [2] Rivest RL, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems. Commun ACM [Internet]. 1978;21(2):120–6. Available from: http://portal.acm.org/citation.cfm?doid=359340.359342

      [3] Kelly G, McKenzie B. Security, privacy, and confidentiality issues on the Internet. J Med Internet Res [Internet]. 2002 [cited 2018 Sep 27];4(2):E12. Available from: http://www.ncbi.nlm.nih.gov/pubmed/12554559

      [4] Amin R, Biswas GP. An Improved RSA Based User Authentication and Session Key Agreement Protocol Usable in TMIS. J Med Syst [Internet]. 2015 Aug 28 [cited 2018 Sep 27];39(8):79. Available from: http://www.ncbi.nlm.nih.gov/pubmed/26123833

      [5] Alhothaily A, Alrawais A, Song T, Lin B, Cheng X. QuickCash: Secure Transfer Payment Systems. Sensors (Basel) [Internet]. 2017 Jun 13 [cited 2018 Sep 27];17(6). Available from: http://www.ncbi.nlm.nih.gov/pubmed/28608846

      [6] B.Persis Urbana Ivy PMMK. A modified RSA cryptosystem based on ‘n’ prime numbers. Int J Eng Comput Sci. 2012;1(2):63–6.

      [7] Somani N, Mangal D. An Improved RSA Cryptographic System [Internet]. Vol. 105, International Journal of Computer Applications. 2014 [cited 2018 Sep 27]. Available from: https://research.ijcaonline.org/volume105/number16/pxc3899820.pdf

      [8] Padmaja CJL, Bhagavan VS, Srinivas B. RSA ENCRYPTION USING THREE MERSENNE PRIMES [Internet]. Vol. 14, Int. J. Chem. Sci. 2016 [cited 2018 Sep 27]. Available from: www.sadgurupublications.com

  • Downloads

  • How to Cite

    M. Abd Zaid, M., & Soukaena Hassan, D. (2018). Lightweight Rsa Algorithm Using Three Prime Numbers. International Journal of Engineering & Technology, 7(4.36), 293-295. https://doi.org/10.14419/ijet.v7i4.36.23790