摘要: Paillier cryptosystem系统加解密流程如下: which λ=lcm(p−1,q−1),L(u)=(u−1)/n Proof: g∈Z∗n2,∴∃(a,b),s.t. g=(n+1)^a*b^n(mod n^2) c^λ=(n+1)^amλ*b^nmλ*r^nλ=(n+1)^amλ 阅读全文
posted @ 2020-05-04 15:00 S4tan 阅读(499) 评论(0) 推荐(0)