RSA

RSA (Rivest Shamir Adleman): RSA is an early example of PHE and introduced by Rivest, Shamir, and Adleman [Rivest et al. 1978b] shortly after the invention of public key cryptography by Diffie Helman [Diffie and Hellman 1976]. RSA is the first feasible achievement of the public key cryptosystem. Moreover, the homomorphic property of RSA was shown by Rivest, Adleman, and Dertouzous [Rivest et al. 1978a] just after the seminal work of RSA. Indeed, the first attested use of the term “privacy homomorphism” is introduced in [Rivest et al. 1978a]. The security of the RSA cryptosystem is based on the hardness of factoring problem of the product of two large prime numbers.