Safest-Value of the Number of Primes in RSA Modulus and an Improvised Generalized Multi-Moduli RSA

Jay Mehta () and Hitarth Rana ()
Additional contact information
Jay Mehta: Department of Mathematics, Sardar Patel University, Vallabh Vidyanagar 388 120, India
Hitarth Rana: Department of Mathematics, Sardar Patel University, Vallabh Vidyanagar 388 120, India

Mathematics, 2025, vol. 13, issue 10, 1-15

Abstract: Several attacks on the well-known RSA cryptosystem that can be extended to a multi-prime version of RSA reveal that it is preferable to use the modulus having more prime factors. On the contrary, the larger the number of prime factors of the modulus, the greater the risk of its factorization, due to the reduced size of its prime factors. In this paper, we derive an optimal value of the number of prime factors in a multi-prime RSA modulus and introduce the notion of the “safest-value” and determine such safest-values for moduli of different sizes. By utilizing this concept, we propose an enhanced version of our Generalized Multi-Moduli RSA (GMMRSA), which is now secure against even more attacks than its previous version.

Keywords: RSA cryptosystem; multi-prime RSA; multi-moduli RSA; safest-value; security; GMMRSA (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/10/1690/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/10/1690/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:10:p:1690-:d:1661183

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().