In this article, we study the encryption performance of the Paillier cryptosystem, a partially homomorphic cryptosystem that allows to perform sums on encrypted data without having to decrypt first. With a combination of both new and known methods, we increase the encryption performance by orders of magnitude compared to a na\"ive implementation. The new methods reduce the bottleneck of noise calculation by using pre-computed noise to generate new noise in a much faster way than by using standard methods.
Category / Keywords: implementation / Paillier, homomorphic encryption, performance improvements Date: received 7 Sep 2015 Contact author: alexander maximov at ericsson com Available format(s): PDF | BibTeX Citation Version: 20150908:060334 (All versions of this report) Short URL: ia.cr/2015/864 Discussion forum: Show discussion | Start new discussion