I'm implementing Paillier encryption and I'd like some recommendations about improving its performance.
Firstly, I have to note the following:
- I have already set g=1+n to get rid of one exponentiation.
- I've been using the CRT to improve decryption.
Nevertheless, the computation of r^n mod n^2 is rather intensive, do you have any other trick to improve the performance?
Note: I don't want to use the Catalano et al. improvement with e as I want to keep its homomorphic property intact.