Citation :

TOPE-OKE Adebusola. M, AWEH Opani, BABALOLA Gbemisola, DABO Laura, 2023. "Implementation and Performance Comparison of the Decryption Computation Variants in the Multi-Prime Rivest, Shamir and Adleman (RSA) Algorithm" ESP International Journal of Advancements in Computational Technology (ESP-IJACT)  Volume 1, Issue 3: 56-62.

Abstract :

This study performed a performance analysis of multi-prime RSA decryption variations' applicability for various system applications. The goal of the research was to determine how suitable the various decryption variations are for different application systems with varying system requirements. The object oriented analysis and design (OOAD) approach was used to create an application that implements the decryption variants, which was then implemented in the Java programming language. In the decryption phase, the application was used to encrypt files using three prime numbers and decrypt separate files using the Aryabhatta Remainder Theorem (ART), Garner method, and Gauss algorithm.

References :

[1] S. Kumar,. Review on Network Security and Cryptography. International Transaction of Electrical and Computer Engineers System, vol 3 No.1, 1–11. 2015. https://doi.org/doi:10.12691/iteces-3-1-1.

[2] Dent, A. W. (2006). Fundamental problems in provable security and cryptography, Information Security Group. Retrieved from https://eprint.iacr.org/2006/278.pdf

[3] Rivest, R. L., Shamir, A., andn Adleman, L. . A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, vol.26, No1,1983, pp 96–99. https://doi.org/10.1145/357980.358017

[4] S.Robinson,. Safe and secure: data encryption for embedded systems. EDN Europe, vol. 53 No. 6,.2008, PP 24-33.

[5] D. Calloway,. Introduction to cryptography and its role in network security: Principles and practices. 2009. Retrieved from http://www.dancalloway.com/.

[6] D. Boneh,. and H. Shacham, . Fast variants of RSA, Cryptobytes, vol 5. No.1, 2002,1-9. RSA Laboratories.

[7] N. Ojha, and S. Padhye, . Cryptanalysis of Multiprime RSA with Secret Key Greater than Public key, International Journal of Network Security, vol.16 No.1, 2014 ,pp53-57.

[8] J. Andress, (2011) . The Basics of Information Security., https://doi.org/10.1016/c2010-0- 68336-2

[9] RSA Laboratories . RSA Laboratories‟ Frequently Asked Questions About Today‟s Cryptography, Version 4.1, 2000, RSA Security Inc.

[10] T.R.N.Rao, & Yang, C.H. (2006) Aryabhatta Remainder Theorem: Relevance to Public-Key Crypto-Algorithms, Circuits, Systems and Signal Processing, vol.25 No.1, 2006, pp1-15. https://doi.org/10.1007/s00034-005-1123-6

[11] M.A. Islam, Md. A. Islam, N. Islam, and B. Shabnam. A modified and secured RSA public key cryptosystem based on “n” prime numbers. JCC Vol.6, 2018, 78-90. https://doi.org/10.4236/jcc.2018.63006

[12] M. G. Kamardan, N. Aminudin, N. Che-Him, S. Sufahani, K. Khalid, and R. Roslan. Modified Multi Prime RSA Cryptosystem. in Journal of Physics: Conference Series, 995, 012030. 2018 https://doi.org/10.1088/1742- 6596/995/1/012030

[13] C. Padmaja, V. Bhagavan, and B. Srinivas, using Aryabhatta Remainder Theorem to Decrypt a Message with RPrime and Rebalanced RSA. International Journal of Engineering & Technology, vol.7 No. 2.7, 2018, pp758-762. https://doi.org/10.14419/ijet.v7i2.7.10940

[14] H. Sahay . Modified RSA Cryptosystem. International Journal of Innovative Science, Engineering and Technology, vol. 4 No.1, 2017 pp249-253. Retrieved from http://www. http://ijiset.com/vol4/v4s1/IJISET_V4_I01_33.pdf

[15] A.Tariq, A. Bharti, D. Kumawat, and S. Naz. A framework for generating multi prime RSA using sieve function, International Journal of Engineering Technology Science and Research, 4(11), 2017. Retrieved from https://www.ijetsr.com/

[16] M. Agrawal, B. Pal, and R. Maheshwari. Improvement over public key cryptosystem RSA by implementing new decryption key generation algorithm. International Journal of Engineering and Management Research, 5(6), 2015, pp300-304. Retrieved from http://www.ijemr.net

[17] T. Cormen, C. ,Leiserson, R. Rivest, and C. Stein. Introduction to algorithms. Cambridge, Massachusetts: MIT Press. 2009.

[18] L. Anany. Introduction to the design & analysis of algorithms. Boston ; Montr al Pearson Addison-Wesley 2012.

[19] I Pearce,., cited: Indian Mathematics: Redressing the Balance. 2002. Retrieved October 26, 2019, from mathshistory.st-andrews.ac.uk website: http://wwwhistory.mcs.st-andrews.ac.uk/history/Projects/Pearce/index.html

[21] H. Garner. The residue number system. IRE Transactions on Electronic Computers, vol. 8 No. 2, 1959 PP140– 147.

[22] A. J Menezes,., and S.A.Vanstone. Handbook of applied cryptography. Boca Raton: Crc Press.2001.

Keywords :

Algorithm Comparison, Decryption, Multiprime, RSA.