Hello all, here is a problem I am working on that is giving me some problems.
p,q, and N are defined as in RSA i.e.
{p,q} in (Z_p,*), N = pq
a in (Z_n,*)
g in (Z_{N^2}) s.t. g=aN+1 mod N^2
The problem is to show that the discrete log problem base g is easy in Z_{N^2}, i.e. :
given...