Cryptology ePrint Archive: Report 2017/582

(Finite) Field Work: Choosing the Best Encoding of Numbers for FHE Computation

Angela Jäschke and Frederik Armknecht

Abstract: Fully Homomorphic Encryption (FHE) schemes allow arbitrary computations on encrypted data, making them a promising tool for numerous use cases that require outsourcing computation on private data to untrusted parties. FHE schemes operate over finite fields while many use cases call for real numbers, requiring appropriate encoding of the data into the scheme's plaintext space. However, the choice of encoding can tremendously impact the computational effort on the encrypted data. Although the question of selecting the encoding arises immediately in practice, users are mostly left alone in choosing it.

In this work, we investigate this question for applications that operate over integers and rational numbers using $p$-adic encoding and the extensions $p$'s Complement and Sign-Magnitude, based on three natural metrics: the number of finite field additions, multiplications, and the multiplicative depth. Our results are partly constructive and partly negative: For the first two metrics, an optimal choice exists and we state it explicitly. However, for multiplicative depth the optimum depends on the use-case and does not exist globally. We do show how to choose this best encoding depending on the use-case.

Category / Keywords: public-key cryptography / Fully Homomorphic Encryption, FHE, Encoding, Effort Analysis

Original Publication (with major differences): CANS 2017

Date: received 14 Jun 2017, last revised 27 Oct 2017

Contact author: jaeschke at uni-mannheim de

Available format(s): PDF | BibTeX Citation

Note: Slight revisions so that structure is the same as CANS-paper.

Version: 20171027:184459 (All versions of this report)

Short URL: ia.cr/2017/582

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]