UPM Institutional Repository

Efficient methods to overcome Rabin cryptosystem decryption failure


Citation

Mahad, Zahari and Asbullah, Muhammad Asyraf and Kamel Ariffin, Muhammad Rezal (2017) Efficient methods to overcome Rabin cryptosystem decryption failure. Malaysian Journal of Mathematical Sciences, 11 (spec. Apr.). pp. 9-20. ISSN 1823-8343; ESSN: 2289-750X

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=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.


Download File

Additional Metadata

Item Type: Article
Divisions: Faculty of Science
Institute for Mathematical Research
Publisher: Institute for Mathematical Research, Universiti Putra Malaysia
Notes: Special issue: The 2nd International Conference and Workshop on Mathematical Analysis (ICWOMA 2016)
Keywords: Rabin cryptosystem; Unique decryption; Equivalent to factorization
Depositing User: Nabilah Mustapa
Date Deposited: 03 May 2017 04:16
Last Modified: 03 May 2017 04:16
URI: http://psasir.upm.edu.my/id/eprint/51906
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item