Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2025
License: CC BY
Data sources: ZENODO
ZENODO
Article . 2025
License: CC BY
Data sources: Datacite
ZENODO
Article . 2025
License: CC BY
Data sources: Datacite
versions View all 2 versions
addClaim

Enhancing Private Key Cryptosystems: A Secure Approach with Pairwise Coprime Moduli

Authors: Nagabharana. N, L. Praveen Kumar, L. Jyotsna;

Enhancing Private Key Cryptosystems: A Secure Approach with Pairwise Coprime Moduli

Abstract

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.

  • BIP!
    Impact byBIP!
    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
Powered by OpenAIRE graph
Found an issue? Give us feedback
citations
The total number of citations received by all articles of the researcher of interest.
BIP!Citations provided by BIP!
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.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Green