Helper

enc_mul_dist

Section paillier_params
Type Lemma
Proof Lines 8

Signature

Lemma enc_mul_dist : forall (m1 m2 : 'Z_n) (r1 r2 : {unit 'Z_n2}), paillier_enc m1 r1 * paillier_enc m2 r2 = paillier_enc (m1 + m2) (r1 * r2)%g.

Description

Encryption multiplication distributes as addition on messages

Uses (0)

This lemma does not use any other lemmas from the stats.

Used By (0)

No lemmas in the stats use this lemma.

Coq Source Code

View on GitHub
Loading source code...
← Back to Stats