Fast decryption method for a Rabin primitive-based cryptosystem
The Chinese Remainder Theorem (CRT) is an algorithm for solving linear congruence system into a unique representation and has been a useful tool in applications of cryptography. For real-world practicality, Garner’s algorithm is efficient to speed up the CRT computation. Recently, a cryptosystem bas...
Saved in:
Main Authors: | Asbullah, Muhammad Asyraf, Kamel Ariffin, Muhammad Rezal |
---|---|
Format: | Article |
Language: | English |
Published: |
Advanced Institute of Convergence Information Technology
2014
|
Online Access: | http://psasir.upm.edu.my/id/eprint/37655/1/Fast%20decryption%20method%20for%20a%20Rabin%20primitive-based%20cryptosystem.pdf http://psasir.upm.edu.my/id/eprint/37655/ http://www.aicit.org/dl/citation.html?id=IJACT-3444 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Efficient methods to overcome Rabin cryptosystem decryption failure
by: Mahad, Zahari, et al.
Published: (2017) -
Design of Rabin-like cryptosystem without decryption failure
by: Asbullah, Muhammad Asyraf, et al.
Published: (2016) -
Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem
by: Mahad, Zahari, et al.
Published: (2014) -
Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem
by: Mahad, Zahari, et al.
Published: (2015) -
Analysis on the Rabin-p cryptosystem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2016)