Editing Paillier cryptosystem (section)

{{short description|Algorithm for public key cryptography}}
The '''Paillier cryptosystem''', invented by and named after Pascal Paillier in 1999, is a probabilistic [[asymmetric algorithm]] for [[public key cryptography]]. The problem of computing ''n''-th residue classes is believed to be computationally difficult. The [[decisional composite residuosity assumption]] is the [[intractability (complexity)|intractability]] hypothesis upon which this cryptosystem is based.

The scheme is an additive [[Homomorphic encryption|homomorphic cryptosystem]]; this means that, given only the public key and the
encryption of <math>m_1</math> and <math>m_2</math>, one can compute the encryption of <math>m_1+m_2</math>.