The proposed reliable network 3-dimension RSA cryptosystem

New contribution in this work has been proposed through designing the reliable network three dimension RSA public key cryptosystem (RN3D-RSA). On the RN3D-RSA cryptosystem, the keys namely private a = ai = 1,2,3 and public Pk = Pki = 1,2,3 keys are generated in 3-deminsion. The plaintext is selected over a prime field and divided into 3-parts m = mi = 1,2,3 and represented as the NR3D-RSA which is sent to first (decoder) user. Decrypting the ciphertext to recover the original plaintext mi = 1,2,3 has been done using the modification that is proposed also in this work on the reliable decomposition method. This modification is used to compute the reliability of the ciphertext Ci = 1,2,3 in NR3D-RSA. With using the modified reliable decomposition (MRD) method, more secure communication has been occurred, since the failed path that is broken by any attacker can be ignored and it is possible to create new path that helps the decoder to recover the original plaintext easily. So, the proposed RN3D-RSA cryptosystem considers as a new bright network for communication with high level of the security.