Efficient methods to overcome rabin cryptosystem decryption failure

Rabin cryptosystem is an efficient factoring-based scheme,however,its decryption produces 4-to-1 output,which leads to decryption failure. in this work,in order to overcome the 4-to-1 decryption problem for the rabin cryptosystem,we propose two distinct methods using the modulus of the type n = p2q coupled with the restriction on the plaintext space m. in the first method,the plaintext space is limited to m ε zpq. for the second method,we restrict the plaintext in the range of m ε (0; 22n-2). importantly,we prove that the decryption output of the proposed methods is unique and without decryption failure. the results in this work indicate that the decryption problem of rabin cryptosystem is overcome.