Citation
Abstract
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.
Download File
Official URL or Download Paper: http://einspem.upm.edu.my/journal/fullpaper/vol10s...
|
Additional Metadata
| Item Type: | Article |
|---|---|
| Divisions: | Faculty of Science Institute for Mathematical Research |
| Publisher: | Institute for Mathematical Research, Universiti Putra Malaysia |
| Notes: | Special issue: The 7th International Conference on Research and Education in Mathematics (ICREM7) |
| Keywords: | Rabin cryptosystem; Modulus N = p2q; Unique decryption; Equivalent to factorization; Chinese remainder theorem |
| Depositing User: | Nabilah Mustapa |
| Date Deposited: | 05 Jun 2017 09:34 |
| Last Modified: | 05 Jun 2017 09:34 |
| URI: | http://psasir.upm.edu.my/id/eprint/52355 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |