I need to know the computational complexity of the public key encryption (e.g. Paillier), please.
(i.e.Paillier in his paper mentions that the computational complexity of most of public key encryptions is $O(n^3)$, but is not clear to me why)
Asked
Active
Viewed 64 times
