
In our previous work, “Enhancing Communication Security: A Private Key Cryptosystem Employing the CRT,” we developed a private key encryption scheme using distinct prime moduli. While primes offer structured mathematical properties, their identification for large numbers is computationally demanding. In this work, we extend our approach by replacing prime moduli with pairwise co-prime integers, eliminating the need for primality testing and simplifying key selection. This extension not only avoids the complexity of choosing large primes but also enhances security by allowing greater flexibility in modulus selection, as any set of pairwise coprime integers can be used. Unlike factorization-dependent cryptosystems, our scheme ensures that neither the individual moduli nor their product is exposed, rendering standard factorizationbased attacks ineffective. We analyze the theoretical foundation, security implications, and computational efficiency of this modified scheme, demonstrating its advantages for secure communication.
| citations The total number of citations received by all articles of the researcher of interest. | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
