In Paillier homomorphic encryption, do we need to take modulo after multiplication of 2 ciphertexts?

Published: 14/11/2017
In Paillier homomorphic encryption, do we need to take modulo after multiplication of 2 ciphertexts?
Source: CRYPTO.STACKEXCHANGE.COM

The multiplication of 2 ciphertexts generated using Paillier encryption will result in encryption of sum of corresponding plaintexts. I need to do a linear combination operation of N integers in Paillier encrypted domain. Then after multiplying every 2 ciphertexts, do I have to take mod with respect to n^2. OR Is it enough to take mod after multiplying all the N ciphertexts? Will both give the sam

Read more
Related news
Comment