Efficient methods to overcome Rabin cryptosystem decryption failure
Rabin cryptosystem is an efficient factoring-based scheme, however, its decryption produces 4-to-1 output, which leads to decryption failure. In this work, in order to overcome the 4-to-1 decryption problem for the Rabin cryptosystem, we propose two distinct methods using the modulus of the type N=p...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute for Mathematical Research, Universiti Putra Malaysia
2017
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/51906/1/2.%20Zahari.pdf http://psasir.upm.edu.my/id/eprint/51906/ http://einspem.upm.edu.my/journal/fullpaper/vol11sapril/2.%20Zahari.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|