How can we prove mathematically that in Paillier cryptosystem decryption, our message is equal to the right side of $$M=L(c^{\lambda(n)}\bmod n^2)\,\mu\bmod n$$
$\begingroup$
$\endgroup$
2
-
1$\begingroup$ Lindell's Book has it! $\endgroup$– kelalakaCommented Apr 13, 2021 at 14:27
-
1$\begingroup$ As kelala mentions, there are plenty of standard sources for this. Perhaps you can show us what you have tried and then we could guide you from there $\endgroup$– DanielCommented Apr 13, 2021 at 16:19
Add a comment
|