Efficiently Processing Complex-Valued Data in Homomorphic Encryption

Journal of mathematical cryptology

article

Carl Bootland¹  Wouter Castryck²  Ilia Iliashenko¹  Frederik Vercauteren¹ 

[1] KU Leuven imec-COSIC;KU Leuven Department of Mathematics

关键词: homomorphic encryption;    data encoding;   

DOI  :  10.1515/jmc-2015-0051

学科分类：社会科学、人文和艺术（综合）

来源: De Gruyter

【 摘 要 】

We introduce a new homomorphic encryption scheme that is natively capable of computing with complex numbers. This is done by generalizing recent work of Chen, Laine, Player and Xia, who modified the Fan–Vercauteren scheme by replacing the integral plaintext modulus t by a linear polynomial X − b . Our generalization studies plaintext moduli of the form X m + b . Our construction significantly reduces the noise growth in comparison to the original FV scheme, so much deeper arithmetic circuits can be homomorphically executed.

【 授权许可】

CC BY|CC BY-NC-ND