Design of Rabin-like cryptosystem without decryption failure
In this work, we design a new, efficient and practical Rabin-like cryptosystem without using the Jacobi symbol, redundancy in the message and avoiding the demands of extra information for finding the correct plaintext. Decryption outputs a unique plaintext without any decryption failure. In addition...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute for Mathematical Research, Universiti Putra Malaysia
2016
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/52355/ http://psasir.upm.edu.my/id/eprint/52355/1/52355.pdf |
| _version_ | 1848852082548801536 |
|---|---|
| author | Asbullah, Muhammad Asyraf Kamel Ariffin, Muhammad Rezal |
| author_facet | Asbullah, Muhammad Asyraf Kamel Ariffin, Muhammad Rezal |
| author_sort | Asbullah, Muhammad Asyraf |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | In this work, we design a new, efficient and practical Rabin-like cryptosystem without using the Jacobi symbol, redundancy in the message and avoiding the demands of extra information for finding the correct plaintext. Decryption outputs a unique plaintext without any decryption failure. In addition, decryption only requires a single prime. Furthermore, the decryption procedure only computes a single modular exponentiation instead of two modular exponentiation executed by other Rabin variants. As a result, this reduces the computational effort during the decryption process. Moreover the Novak’s side channel attack is impractical over the proposed Rabin-like cryptosystem. In parallel, we prove that the Rabin-p cryptosystem is indeed as intractable as the integer factorization problem. |
| first_indexed | 2025-11-15T10:32:25Z |
| format | Article |
| id | upm-52355 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T10:32:25Z |
| publishDate | 2016 |
| publisher | Institute for Mathematical Research, Universiti Putra Malaysia |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-523552017-06-05T09:34:17Z http://psasir.upm.edu.my/id/eprint/52355/ Design of Rabin-like cryptosystem without decryption failure Asbullah, Muhammad Asyraf Kamel Ariffin, Muhammad Rezal In this work, we design a new, efficient and practical Rabin-like cryptosystem without using the Jacobi symbol, redundancy in the message and avoiding the demands of extra information for finding the correct plaintext. Decryption outputs a unique plaintext without any decryption failure. In addition, decryption only requires a single prime. Furthermore, the decryption procedure only computes a single modular exponentiation instead of two modular exponentiation executed by other Rabin variants. As a result, this reduces the computational effort during the decryption process. Moreover the Novak’s side channel attack is impractical over the proposed Rabin-like cryptosystem. In parallel, we prove that the Rabin-p cryptosystem is indeed as intractable as the integer factorization problem. Institute for Mathematical Research, Universiti Putra Malaysia 2016 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/52355/1/52355.pdf Asbullah, Muhammad Asyraf and Kamel Ariffin, Muhammad Rezal (2016) Design of Rabin-like cryptosystem without decryption failure. Malaysian Journal of Mathematical Sciences, 10 (spec. Aug.). pp. 1-18. ISSN 1823-8343; ESSN: 2289-750X http://einspem.upm.edu.my/journal/fullpaper/vol10saugust/1.%20Asyraf.pdf |
| spellingShingle | Asbullah, Muhammad Asyraf Kamel Ariffin, Muhammad Rezal Design of Rabin-like cryptosystem without decryption failure |
| title | Design of Rabin-like cryptosystem without decryption failure |
| title_full | Design of Rabin-like cryptosystem without decryption failure |
| title_fullStr | Design of Rabin-like cryptosystem without decryption failure |
| title_full_unstemmed | Design of Rabin-like cryptosystem without decryption failure |
| title_short | Design of Rabin-like cryptosystem without decryption failure |
| title_sort | design of rabin-like cryptosystem without decryption failure |
| url | http://psasir.upm.edu.my/id/eprint/52355/ http://psasir.upm.edu.my/id/eprint/52355/ http://psasir.upm.edu.my/id/eprint/52355/1/52355.pdf |