Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem
We propose a new efficient method to overcome the 4 to 1 decryption failure for the Rabin cryptosystem by reducing the phase space of plaintext from M ε ℤ to M ε 22n-2, 22n-1 ⊂ ℤpq, where pq is a product of 2 strong primes and pq ε 22n, 22n+2. Instead of utilizing the pubic modulus N = pq, we use N...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Malaysian Society for Cryptology Research
2015
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/51907/ http://psasir.upm.edu.my/id/eprint/51907/1/Rabin-RZ%20a%20new%20efficient%20method%20to%20overcome%20Rabin%20cryptosystem%20decryption%20failure%20problem.pdf |
| _version_ | 1848851960883576832 |
|---|---|
| author | Mahad, Zahari Kamel Ariffin, Muhammad Rezal |
| author_facet | Mahad, Zahari Kamel Ariffin, Muhammad Rezal |
| author_sort | Mahad, Zahari |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | We propose a new efficient method to overcome the 4 to 1 decryption failure for the Rabin cryptosystem by reducing the phase space of plaintext from M ε ℤ to M ε 22n-2, 22n-1 ⊂ ℤpq, where pq is a product of 2 strong primes and pq ε 22n, 22n+2. Instead of utilizing the pubic modulus N = pq, we use N = p2q. Upon decrypting by using the private modulus d = pq via the Chinese Remainder Theorem, we prove that there exist only one plaintext from the 4 roots obtained that will reside within the interval 22n, 22n+2. As a result, the decryption failure is overcome and this technique also enhances the decryption process for the Rabin cryptosystem. Furthermore, we make analytical comparison with other methods designed in previous literature to overcome the Rabin cryptosystem problem. |
| first_indexed | 2025-11-15T10:30:29Z |
| format | Article |
| id | upm-51907 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T10:30:29Z |
| publishDate | 2015 |
| publisher | Malaysian Society for Cryptology Research |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-519072017-05-03T04:14:06Z http://psasir.upm.edu.my/id/eprint/51907/ Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem Mahad, Zahari Kamel Ariffin, Muhammad Rezal We propose a new efficient method to overcome the 4 to 1 decryption failure for the Rabin cryptosystem by reducing the phase space of plaintext from M ε ℤ to M ε 22n-2, 22n-1 ⊂ ℤpq, where pq is a product of 2 strong primes and pq ε 22n, 22n+2. Instead of utilizing the pubic modulus N = pq, we use N = p2q. Upon decrypting by using the private modulus d = pq via the Chinese Remainder Theorem, we prove that there exist only one plaintext from the 4 roots obtained that will reside within the interval 22n, 22n+2. As a result, the decryption failure is overcome and this technique also enhances the decryption process for the Rabin cryptosystem. Furthermore, we make analytical comparison with other methods designed in previous literature to overcome the Rabin cryptosystem problem. Malaysian Society for Cryptology Research 2015 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/51907/1/Rabin-RZ%20a%20new%20efficient%20method%20to%20overcome%20Rabin%20cryptosystem%20decryption%20failure%20problem.pdf Mahad, Zahari and Kamel Ariffin, Muhammad Rezal (2015) Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem. International Journal of Cryptology Research, 5 (1). pp. 11-20. ISSN 1985-5753 http://www.mscr.org.my/ijcr_volumes%205(1).htm |
| spellingShingle | Mahad, Zahari Kamel Ariffin, Muhammad Rezal Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem |
| title | Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem |
| title_full | Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem |
| title_fullStr | Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem |
| title_full_unstemmed | Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem |
| title_short | Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem |
| title_sort | rabin-rz: a new efficient method to overcome rabin cryptosystem decryption failure problem |
| url | http://psasir.upm.edu.my/id/eprint/51907/ http://psasir.upm.edu.my/id/eprint/51907/ http://psasir.upm.edu.my/id/eprint/51907/1/Rabin-RZ%20a%20new%20efficient%20method%20to%20overcome%20Rabin%20cryptosystem%20decryption%20failure%20problem.pdf |