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 ϵ ℤ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...

Full description

Bibliographic Details
Main Authors: Mahad, Zahari, Kamel Ariffin, Muhammad Rezal
Format: Conference or Workshop Item
Language:English
Published: Institute for Mathematical Research, Universiti Putra Malaysia 2014
Online Access:http://psasir.upm.edu.my/id/eprint/66483/1/Cryptology2014-4.pdf
_version_ 1825933144170168320
author Mahad, Zahari
Kamel Ariffin, Muhammad Rezal
author_facet Mahad, Zahari
Kamel Ariffin, Muhammad Rezal
author_sort Mahad, Zahari
collection UPM
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 ϵ ℤ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.
first_indexed 2024-03-06T09:52:46Z
format Conference or Workshop Item
id upm.eprints-66483
institution Universiti Putra Malaysia
language English
last_indexed 2024-03-06T09:52:46Z
publishDate 2014
publisher Institute for Mathematical Research, Universiti Putra Malaysia
record_format dspace
spelling upm.eprints-664832019-03-03T23:54:30Z http://psasir.upm.edu.my/id/eprint/66483/ 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 ϵ ℤ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. Institute for Mathematical Research, Universiti Putra Malaysia 2014 Conference or Workshop Item PeerReviewed text en http://psasir.upm.edu.my/id/eprint/66483/1/Cryptology2014-4.pdf 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).
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/66483/1/Cryptology2014-4.pdf
work_keys_str_mv AT mahadzahari rabinrzanewefficientmethodtoovercomerabincryptosystemdecryptionfailureproblem
AT kamelariffinmuhammadrezal rabinrzanewefficientmethodtoovercomerabincryptosystemdecryptionfailureproblem