Polynomial-driven fuzzy network cryptosystem based on multi-prime RSA encryption

In the modern digital era, the level of security is much dependent on the factors of reliability and robustness. Domination theory provides a powerful mathematical tool for the purpose of controlling and monitoring access among nodes in a fuzzy network. Network models in the form of fuzzy graphs have become important in recent times in view of providing significant development related to lightweight cryptographic systems as they can handle issues related to uncertainty and partial membership effectively. Polynomials are fundamental in cryptography because they are the basis of many algebraic systems that are used in encryption and, most importantly, decryption techniques. Polynomials are employed explicitly or implicitly in all cryptosystems, creating a solid platform upon which communication occurs. This study aims to develop a fuzzy graph network, describing an encrypted version of secret information. Mathematical modeling of the fuzzy graph network is derived based on a multi-prime RSA system. Considering the given text, it creates a polynomial as part of the main key of a cryptosystem. Algorithms for encryption and decryption are developed and explained with the aim of showing the effectiveness of the proposed method. Also, the security level of the developed fuzzy graph network is improved with the incorporation of the domination parameters and the polynomial transformations.

کلیدواژه ها:

Domination ، cryptosystem ، Encryption ، decryption ، Security