Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1515/jmc-2015-0051 | JOURNAL OF MATHEMATICAL CRYPTOLOGY |
Keywords | Field | DocType |
homomorphic encryption, data encoding | Homomorphic encryption,Computer science,Theoretical computer science | Journal |
Volume | Issue | ISSN |
14 | 1 | 1862-2976 |
Citations | PageRank | References |
1 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carl Bootland | 1 | 9 | 1.14 |
| Wouter Castryck | 2 | 58 | 9.43 |
| Ilia Iliashenko | 3 | 1 | 1.02 |
| Frederik Vercauteren | 4 | 681 | 47.97 |