ABSTRACT:
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.
Cite this article:
Sushma Pradhan, Birendra Kumar Sharma. A Modified Variant of RSA Algorithm for Gaussian Integers. Research J. Science and Tech 5(3): July- Sept., 2013 page 300-302.
Cite(Electronic):
Sushma Pradhan, Birendra Kumar Sharma. A Modified Variant of RSA Algorithm for Gaussian Integers. Research J. Science and Tech 5(3): July- Sept., 2013 page 300-302. Available on: https://rjstonline.com/AbstractView.aspx?PID=2013-5-3-3