A novice cryptosystem based on n^th root of Gaussian integers

In cryptography, there are many techniques for encryption and decryption to secure communication between source and destination from different types of attacks. The Rabin cryptosystem is based on quadratic congruence. It is a variation of the RSA cryptosystem. Square root of Gaussian integers was introduced as an Extended Rabin cryptosystem. In this paper, complexity of algorithm is analyzed by increasing value of n larger than 2 and 3; which is useful to give more security to the data and confidential information over the network or internet. In certain circumstances encryption must be performed under specific time duration. The encryption and decryption algorithm based on modular arithmetic of Gaussian integers (complex integers) can satisfy this process.