Public-key cryptosystem based on fully homomorphic encryption | Applied Discrete Mathematics. Supplement. 2015. № 8.

Public-key cryptosystem based on fully homomorphic encryption

In this paper, we discuss the practical usage of fully homomorphic encryption. The application of this encryption to constructing a public-key cryptosystem based on the RSA algorithm is shown. An implementation of this cryptosystem demonstrates that all arithmetical calculations over the encrypted data are correct. Also, it proves that the multiplication of ciphertexts doesn't lead to increasing the dimension of the multiplication result.

Download file

Counter downloads: 316

Keywords

RSA algorithm, public-key cryptosystem, homomorphic encryption, алгоритм RSA, криптосистема с открытым ключом, гомоморфное шифрование

Authors

Name	Organization	E-mail
Egorova V. V.	Novosibirsk State University; Laboratory of modern computer technology SRD NSU	vvegorova@gmail.com
Chechulina D.K.	Novosibirsk State University; Laboratory of modern computer technology SRD NSU

Всего: 2

References

Shamir A. A polynomial time algorithm for breaking the basic Merkle - Hellman cryptosystem // Adv. Cryptology. 1983. P. 279-288.

Knuth D. The Art of Computer Programming. V. 2. Seminumerical Algorithms. Addison- Wesley Pub. Co., 1981.