3 ms·
Is there some simple description of the operations supported and the space and time complexity of them, as well as their effects on "hidden" parameters of the c
by omati 14y ago
Is there some simple description of the operations supported and the space and time complexity of them, as well as their effects on "hidden" parameters of the ciphertexts anywhere?
All the available documentation seems to focus on the underlying implementation and mathematical proofs without clearly stating the user-visible performance behavior.
For example, if I have N encrypted signed B-bit integers (treated as modulo 2^B), and add them all with homomorphic encryption, how much time does that take and how large is the resulting cyphertext?
What if I have two N-dimensional vectors called v and w of B-bit integers (treated as modulo 2^B), and want to compute the value v^T . M . w where M is an NxN matrix?
What if they are floating point instead? Is that supported? Are integers modulo M supported for any M?
Is the sign(x) operation available or just addition and multiplication?
- cantos 14y agoRegarding the last question, if you have an encryption method that can encrypt 0 and 1 and has (efficient) algorithms for multiplying and adding the plaintexts corresponding to encrypted messages then you can efficiently compute any boolean circuit. So any fast algorithm that can be computed without encryption can be computed efficiently by a homomorphic encryption scheme (in time that is some low degree polynomial of the time needed for the unencrypted algorithm).