<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-discrete-mathematical-sciences-and-cryptography</journal-id>
      <journal-title-group>
        <journal-title>Journal of Discrete Mathematical Sciences and Cryptography</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-0065</issn>
      <issn publication-format="print">0972-0529</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JDMSC-2309</article-id>
      <title-group>
        <article-title>A multi-moduli approach towards enhancing the security of multi-prime RSA</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Mehta</surname>
            <given-names>Jay</given-names>
          </name>
          <aff>Department of Mathematics, Sardar Patel University, Vallabh Vidyanagar, Gujarat, 388120, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Rana</surname>
            <given-names>Hitarth</given-names>
          </name>
          <aff>Department of Mathematics, Sardar Patel University, Vallabh Vidyanagar, Gujarat, 388120, India</aff>
        </contrib>
      </contrib-group>
      <fpage>1</fpage>
      <lpage>16</lpage>
      <pub-date date-type="pub">
        <day>19</day>
        <month>06</month>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>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.</p>
      </abstract>
      <kwd-group>
        <kwd>RSA cryptosystem</kwd>
        <kwd>Multi-prime RSA</kwd>
        <kwd>Multi-moduli RSA</kwd>
        <kwd>Key-size</kwd>
        <kwd>Security</kwd>
      </kwd-group>
      <custom-meta-group>
        <custom-meta>
          <meta-name>access</meta-name>
          <meta-value>open</meta-value>
        </custom-meta>
        <custom-meta>
          <meta-name>retracted</meta-name>
          <meta-value>no</meta-value>
        </custom-meta>
      </custom-meta-group>
    </article-meta>
  </front>
</article>
