1. Reliable Rabin cryptosystem using the modified decomposition method.
- Author
-
Kadim, Ban Jasim and Ajeena, Ruma Kareem K.
- Subjects
- *
CONDITIONAL probability - Abstract
In this work, reliable version of Rabin public key cryptosystem (RPKC) has been proposed with 2 dimension. On reliable Rabin public key cryptosystem (R-RPKC) the plaintext M is divided into two parts m1 and m2. Each part is encrypted independently to create two paths of the sub-ciphertexts (C1, C2) and (C1', C2'). The reliable system of encrypted plaintext in 2 dim-RPKC is designed as new main point in this work. If one path from two sub-ciphertexts fails through the break down by attacker then it is possible to create new path with new sub-ciphertext. This can be done using the modify decomposition method (M-DM) (which is also named by modify conditional probability approach (M-CPA)) that is proposed in this work as well. The M-DM in compare with original DM deletes the failure path (that is attacked path) and changing it through creating new sub-ciphertext path. The new experimental result of R-RPKC is discussed as study case with small parameters. The security considerations on R-RPKC are determined. Using the M-DM, the R-RPKC considers as more secure cryptosystem or communication in comparing with original one. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF