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=p...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute for Mathematical Research, Universiti Putra Malaysia
2017
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/51906/ http://psasir.upm.edu.my/id/eprint/51906/1/2.%20Zahari.pdf |
| _version_ | 1848851960583684096 |
|---|---|
| author | Mahad, Zahari Asbullah, Muhammad Asyraf Kamel Ariffin, Muhammad Rezal |
| author_facet | Mahad, Zahari Asbullah, Muhammad Asyraf Kamel Ariffin, Muhammad Rezal |
| author_sort | Mahad, Zahari |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T10:30:29Z |
| format | Article |
| id | upm-51906 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T10:30:29Z |
| publishDate | 2017 |
| publisher | Institute for Mathematical Research, Universiti Putra Malaysia |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-519062017-05-03T04:16:38Z http://psasir.upm.edu.my/id/eprint/51906/ Efficient methods to overcome Rabin cryptosystem decryption failure Mahad, Zahari Asbullah, Muhammad Asyraf Kamel Ariffin, Muhammad Rezal 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. Institute for Mathematical Research, Universiti Putra Malaysia 2017 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/51906/1/2.%20Zahari.pdf 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 http://einspem.upm.edu.my/journal/fullpaper/vol11sapril/2.%20Zahari.pdf |
| spellingShingle | Mahad, Zahari Asbullah, Muhammad Asyraf Kamel Ariffin, Muhammad Rezal Efficient methods to overcome Rabin cryptosystem decryption failure |
| title | Efficient methods to overcome Rabin cryptosystem decryption failure |
| title_full | Efficient methods to overcome Rabin cryptosystem decryption failure |
| title_fullStr | Efficient methods to overcome Rabin cryptosystem decryption failure |
| title_full_unstemmed | Efficient methods to overcome Rabin cryptosystem decryption failure |
| title_short | Efficient methods to overcome Rabin cryptosystem decryption failure |
| title_sort | efficient methods to overcome rabin cryptosystem decryption failure |
| url | http://psasir.upm.edu.my/id/eprint/51906/ http://psasir.upm.edu.my/id/eprint/51906/ http://psasir.upm.edu.my/id/eprint/51906/1/2.%20Zahari.pdf |