Malaysian Journal of Mathematical Sciences, April 2017, Vol. 11(S)
Special Issue: The 2nd International Conference and Workshop on Mathematical Analysis (ICWOMA 2016)
Efficient Methods to Overcome Rabin Cryptosystem Decryption Failure
Mahad, Z., Asbullah, M. A., and Ariffin, M. R. K.
Corresponding Email: zaharimahad@upm.edu.my
Received date: -
Accepted date: -
Abstract:
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=p^2q\) coupled with the restriction on the plaintext space \(M\). In the first method, the plaintext space is limited to \(M \in \mathbb{Z}_{pq}\). For the second method, we restrict the plaintext in the range of \(M \in (0, 2^{2n-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.
Keywords: Rabin cryptosystem, unique decryption, equivalent to factorization
Indexing
