Cryptology ePrint Archive: Report 2019/963

Faster homomorphic encryption is not enough: improved heuristic for multiplicative depth minimization of Boolean circuits

Pascal Aubry and Sergiu Carpov and Renaud Sirdey

Abstract: In somewhat homomorphic encryption schemes (e.g. B/FV, BGV) the size of ciphertexts and the execution performance of homomorphic operations depends heavily on the multiplicative depth. The multiplicative depth is the maximal number of consecutive multiplications for which an homomorphic encryption scheme was parameterized. In this work we propose an improved multiplicative depth minimization heuristic. In particular, a new circuit rewriting operator is introduced, the so called cone rewrite operator. The results we obtain using the new method are relevant in terms of accuracy and performance. Smaller multiplicative depths for a benchmark of Boolean circuits are obtained when compared to a previous work found in the literature. In average, the multiplicative depth is highly improved and the new heuristic execution time is significantly lower. The proposed rewrite operator and heuristic are not limited to Boolean circuits, but can also be used for arithmetic circuits.

Category / Keywords: public-key cryptography / somewhat homomorphic encryption, multiplicative depth, Boolean functions, heuristic

Date: received 24 Aug 2019

Contact author: sergiu carpov at cea fr, p aubry at cea fr, renaud sirdey at cea fr, sergiu carpov cea at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20190826:124035 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]