A Python Library for Paillier Encryption using GMPY2 for arithmetic operations
we used the special case of Paillier’s cryptosystem where p and q are two primes of equivalent bitlength, n=pq; g = n+1, λ=φ(n) and μ=φ(n)^(-1)mod n, where φ(n)=(p-1)(q-1).