RSA Scheme over the Ring of Gaussian Integers

Abstract

RSA over the ring of integers is an asymmetric cryptographic algorithm to encrypt and decrypt messages and its security relies on the hardness of factoring large intagers. In this paper we study the structure of Gaussian integers and we survey a type of RSA over the ring of Gaussian integers, Z[i].