A multi-moduli approach towards enhancing the security of multi-prime RSA

Mehta, Jay; Rana, Hitarth

doi:10.47974/JDMSC-2309

Open Access Research Article

A multi-moduli approach towards enhancing the security of multi-prime RSA

^*Jay MehtaCorresponding authorjay_mehta@spuvvn.eduDepartment of Mathematics Sardar Patel UniversityVallabh Vidyanagar, Gujarat, 388120, India0000-0003-1739-9639View full profile → , Hitarth Ranahitarth.rana@spuvvn.eduDepartment of Mathematics Sardar Patel UniversityVallabh Vidyanagar, Gujarat, 388120, India0009-0004-4360-8187View full profile →

* Corresponding author · click or hover a name for details

pp. 1–16Online FirstJune 2026DOI: 10.47974/JDMSC-2309 Crossmark XML

Received:: 02 Sep 2024
Published Online:: 19 Jun 2026
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-2309
Pages:: 1–16

Abstract

The popular RSA cryptosystem, based on the problem of integer factorization can widely be seen in practice even today. Since its inception, several enhancements and generalizations of RSA are proposed including its several multi-prime variants where the RSA modulus is a product of more than two primes. In this paper, we propose a generalized multi-moduli RSA cryptosystem (GMMRSA) which is a multi-prime RSA but with more than one modulus. We show that this multi-moduli approach yields a more secure cryptosystem than a multi-prime RSA with a single modulus without compromising its computational and time efficiencies.

Keywords

RSA cryptosystem Multi-prime RSA Multi-moduli RSA Key-size Security

Subject Classifications

11T7194A60

References

[1] R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, vol. 21, no. 2, pp. 120–126 (1978).
[2] D. Boneh, “Twenty years of attacks on the RSA cryptosystem,” Notices Amer. Math. Soc., vol. 46, no. 2, pp. 203–213 (1999).
[3] J. M. Pollard, “Theorems on factorization and primality testing,” in Mathematical Proceedings of the Cambridge Philosophical Society, vol. 76(3), pp. 521–528, Cambridge University Press (1974).
[4] H. W. Lenstra Jr, “Factoring integers with elliptic curves,” Annals of mathematics, pp. 649–673 (1987).
[5] M. Mumtaz and L. Ping, “Forty years of attacks on the RSA cryptosystem: A brief survey,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 22, no. 1, pp. 9–29 (2019).
[6] C. Nemo, “RSA Moduli Should Have 3 Prime Factors,” Scientific Bulgarian Magazine, 1996. http://fgrieu.free.fr/CaptainNemo.pdf.
[7] T. Collins, D. Hopkins, S. Langford, and M. Sabin, “Public key cryptographic apparatus and method,” (1998). United States Patent 5,848,159, https://patents. google.com/patent/US5848159A/en.
[8] 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, vol. 995, no. 1, pp. 012030, IOP Publishing (2018).
[9] T. Pathirage, H. Wijewardana, L. Lakshan, H. Hydher, and L. Yasakethu, “Multiprime RSA verilog implementation using 4-primes,” in 2021 10th International Conference on Information and Automation for Sustainability (ICIAfS), pp. 60–65, IEEE (2021).
[10] N. A. A. Sani and H. Kamarulhaili, “RSA cryptography and multi prime RSA cryptography,” in AIP Conference Proceedings, vol. 1870, no. 1, AIP Publishing (2017).
[11] S. Tanwar and A. Kumar, “An efficient and secure identity based multiple signatures scheme based on RSA,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 22, no. 6, pp. 953–971 (2019).
[12] T. Shah, M. Zohaib, Q. Xin, B. Almutairi, and M. Sajjad, “Generalization of RSA cryptosystem based on 2n primes,” AIMS Mathematics, vol. 8, no. 8, pp. 18833–18845 (2023).
[13] Manu and A. Goel, “Encryption algorithm using dual modulus,” in 2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT), pp. 1–4 (2017).
[14] M. J. Hinek, “On the security of multi-prime RSA,” Journal of Mathematical Cryptology, vol. 2, no. 2, pp. 117–147 (2008).

Views: 32Downloads: 11Citations: 0