Let "N=pq" be RSA modulus with public key "e". given an instance (x^e mod N, z mod N) where "z" an take value either (1+x)^2 or any random value, "r" belonging to Z_N, with probability 1/2, what can be the known best algorithm to distinguish (x^e mod N, (1+x)^2 mod N) from (x^e mod N, r) ?
-- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
