Cryptanalysis on the modulus N=p2q and design of rabin-like cryptosystem without decryption failure
Rabin cryptosystem has fast encryption and proven as secure as the integer factorization problem. Nonetheless, its decryption produces four possible correct results with no indicator for choosing the right one is given. Therefore, this scenario leads to a decryption failure. In order to engage with...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2015
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/58664/1/IPM%202015%209IR.pdf http://psasir.upm.edu.my/id/eprint/58664/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|