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

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...

Full description

Bibliographic Details
Published in:Mathematics
Main Authors: Jay Mehta, Hitarth Rana
Format: Article
Language:English
Published: MDPI AG 2025-05-01
Subjects:
Online Access:https://www.mdpi.com/2227-7390/13/10/1690
Description
Summary: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.
ISSN:2227-7390