UPM Institutional Repository

Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem


Mahad, Zahari and Kamel Ariffin, Muhammad Rezal (2014) Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem. In: 4th International Cryptology and Information Security Conference 2014 (CRYPTOLOGY2014), 24-26 June 2014, Putrajaya, Malaysia. (pp. 100-106).


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 ϵ ℤpq to M ϵ (2²ⁿ⁻², 2²ⁿ⁻¹) ⊂ ℤpq, where pq is a product of 2 strong primes and pq ϵ (2²ⁿ, 2²ⁿ⁺²). Instead of utilizing the pubic modulus N = pq, we use N = p²q. 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 (2²ⁿ, 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.

Download File

[img] Text
Restricted to Repository staff only

Download (486kB)

Additional Metadata

Item Type: Conference or Workshop Item (Paper)
Divisions: Faculty of Science
Institute for Mathematical Research
Publisher: Institute for Mathematical Research, Universiti Putra Malaysia
Keywords: Rabin cryptosystem; Rabin-Williams cryptosystem; Integer factorization problem; Square root modulo
Depositing User: Nabilah Mustapa
Date Deposited: 03 Mar 2019 23:54
Last Modified: 03 Mar 2019 23:54
URI: http://psasir.upm.edu.my/id/eprint/66483
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item