Abstract:
The purpose of this paper is to extend the RSA public-key encryption scheme from its classical domain of natural integers Z, to two principal ideal domains, namely the domain of Gaussian integers, Z[i], and the domain of polynomials over finite fields, F[x]. The arithmetic needed for the modifications to these domains are described. The modified RSA algorithms are given. Proofs for the new method are provided. The computational procedures are described and illustrated in numerical examples. The advantages of new scheme over the classical are pointed out.
Academic paper (PDF): Modified RSA in the Domains of Gaussian Integers and Polynomials Over Finite Fields.. Available from: https://www.researchgate.net/publication/220922838_Modified_RSA_in_the_Domains_of_Gaussian_Integers_and_Polynomials_Over_Finite_Fields [accessed Apr 5, 2017].
Citation:
El-Kassar, A. N., Haraty, R. A., Awad, Y. A., & Debnath, N. C. (2005, November). Modified RSA in the Domains of Gaussian Integers and Polynomials Over Finite Fields. In CAINE (pp. 298-303).