network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 5 months |
| seen | May 16 at 21:02 | |
| stats | profile views | 1 |
|
Dec 10 |
comment |
inverse element in Paillier cryptosystem So your idea is that we are still considering the problem of whether there exists a x such that ax=1 mod N, where a here is defined as r^n and N here is defined as n^2 in the Paillier system. Because we know a has the multiplicative inverse only when gcd(a,N)=1, it turns out we know that r^n has the multiplicative inverse only when gcd(r^n,n^2)=1. |
