1
$\begingroup$

In the Paillier cryptosystem, suppose that I know a Ciphertext encrypted with some unknown random $r$ i.e.

$C = (g^m r^n) \bmod n^2 $

I know $g, n$, the prime factorization of $n$, i.e., $pq$. I also know the private key $-$ hence I know the message $m$. Would there be a way for me to recover $r$ easily?

  • 0
    see http://crypto.stackexchange.com/questions/3290/several-questions-about-paillier-cryptosystem2012-09-12

0 Answers 0