UPM Institutional Repository

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


Citation

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

Abstract

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.


Download File

[img]
Preview
PDF (Abstract)
Rabin-RZ a new efficient method to overcome Rabin cryptosystem decryption failure problem.pdf

Download (102kB) | Preview

Additional Metadata

Item Type: Article
Divisions: Faculty of Science
Institute for Mathematical Research
Publisher: Malaysian Society for Cryptology Research
Keywords: Integer factorization problem; Rabin cryptosystem; Rabin-Williams cryptosystem; Square root modulo
Depositing User: Nabilah Mustapa
Date Deposited: 03 May 2017 04:14
Last Modified: 03 May 2017 04:14
URI: http://psasir.upm.edu.my/id/eprint/51907
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item