|visits||member for||1 year|
|seen||Nov 2 at 3:29|
constructing QR-like one way function
you are right, i made a mistake, all of the boave modulos are mod N, N is a composite
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.