Abstract

We proposed a deterministic Rabin cryptosystem algorithm for encryption and decryption. It is based on converting non deterministic Rabin cryptosystem to deterministic Rabin cryptosystem without Jacobi symbol. A message based on redundant technique or padding bits are used to distinguish the original message from the other messages. There is a need to maintain redundancy in the message, such that decrypted message is specific except for the task having very less probability. The proposed scheme works well for a variable odd length plain text messages.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call