Some homomorphic cryptosystems based on nonassociative structures

A homomorphic encryption allows specific types of computations on ciphertext and generates an encrypted result that matches the result of operations performed on the plaintext. Some classic cryptosystems, e.g., RSA and ElGamal, allow homomorphic computation of only one operation. In 2009, C. Gentry suggested a model of a fully homomorphic algebraic system, i.e., a cryptosystem that supports both addition and multiplication operations. This cryptosystem is based on lattices. Later M. Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan suggested a fully homomorphic system based on integers. In a 2010 paper of A. V. Gribov, P. A. Zolotykh, and A. V. Mikhalev, a cryptosystem based on a quasigroup ring was constructed, developing an approach of S. K. Rososhek, and a homomorphic property of this system was investigated. An example of a quasigroup for which this system is homomorphic is given. Also a homomorphic property of the ElGamal cryptosystem based on a medial quasigroup is shown.