Cryptology ePrint Archive: Report 2017/333

Faster Homomorphic Function Evaluation using Non-Integral Base Encoding

Charlotte Bonte and Carl Bootland and Joppe W. Bos and Wouter Castryck and Ilia Iliashenko and Frederik Vercauteren

Abstract: In this paper we present an encoding method for fixed-point numbers tailored for homomorphic function evaluation. The choice of the degree of the polynomial modulus used in all popular somewhat homomorphic encryption schemes is dominated by security considerations, while with the current encoding techniques the correctness requirement allows for much smaller values. We introduce a generic encoding method using expansions with respect to a non-integral base, which exploits this large degree at the benefit of reducing the growth of the coefficients when performing homomorphic operations. In practice this allows one to choose a smaller plaintext coefficient modulus which results in a significant reduction of the running time. We illustrate our approach by applying this encoding in the setting of homomorphic electricity load forecasting for the smart grid which results in a speed-up by a factor 13 compared to previous work, where encoding was done using balanced ternary expansions.

Category / Keywords: public-key cryptography /

Date: received 14 Apr 2017

Contact author: wouter castryck at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20170418:212838 (All versions of this report)

Short URL: ia.cr/2017/333

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]