Algorithmic Support for Rabin Cryptosystem Implementation Based on Addition

Abstract

This paper deals with algorithmic support for Rabin cryptosystem implementation based on addition without performing computationally expensive arithmetic operations. Due to this, there is a reduction in time and hardware complexity of the encryption and decryption processes. The proposed approach allows us to increase the amount of input data and the size of the keys in order to improve the security of the cryptosystem not affecting its efficiency. An example of Rabin cryptosystem implementation based on addition is given.