def crt(self, mp, mq):
        """the Chinese Remainder Theorem as needed for decryption.
           return the solution modulo n=pq.
       """
        u = (mp - mq) * self.q_inverse % self.p
        x = (mq + (u * self.q)) % self.public_key.n

        return x
the Chinese Remainder Theorem as needed for decryption.
           return the solution modulo n=pq.
       
fedlearner/model/crypto/paillier.py