IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i10p1690-d1661183.html
   My bibliography  Save this article

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

Author

Listed:
  • Jay Mehta

    (Department of Mathematics, Sardar Patel University, Vallabh Vidyanagar 388 120, India
    These authors contributed equally to this work.)

  • Hitarth Rana

    (Department of Mathematics, Sardar Patel University, Vallabh Vidyanagar 388 120, India
    These authors contributed equally to this work.)

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.

Suggested Citation

  • Jay Mehta & Hitarth Rana, 2025. "Safest-Value of the Number of Primes in RSA Modulus and an Improvised Generalized Multi-Moduli RSA," Mathematics, MDPI, vol. 13(10), pages 1-15, May.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:10:p:1690-:d:1661183
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/10/1690/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/10/1690/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Luis V. Dieulefait & Jorge Urroz, 2020. "Factorization and Malleability of RSA Moduli, and Counting Points on Elliptic Curves Modulo N," Mathematics, MDPI, vol. 8(12), pages 1-10, November.
    2. Shixiong Wang & Minghao Sun, 2024. "New Cryptanalysis of Prime Power RSA with Two Private Exponents," Mathematics, MDPI, vol. 12(21), pages 1-12, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:10:p:1690-:d:1661183. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.