Design of rabin-like cryptosystem without decryption failure

In this work,we design a new,efficient and practical rabin-like cryptosystem without using the jacobi symbol,redundancy in the message and avoiding the demands of extra information for finding the correct plaintext. decryption outputs a unique plaintext without any decryption failure. in addition,decryption only requires a single prime. furthermore,the decryption procedure only computes a single modular exponentiation instead of two modular exponentiation executed by other rabin variants. as a result,this reduces the computational effort during the decryption process. moreover the novak's side channel attack is impractical over the proposed rabin-like cryptosystem. in parallel,we prove that the rabin-p cryptosystem is indeed as intractable as the integer factorization problem.