A Modified Variant of RSA Algorithm for Gaussian Integers

A Gaussian prime is a Gaussian integer that cannot be expressed in the form of the product of other Gaussian integers. The concept of Gaussian integer was introduced by Gauss who proved its unique factorization domain. In this paper, we propose a modified RSA variant using the domain of Gaussian integers providing more security as compare to the old one.