One may use the following approach in Sage but will not efficient for larger e. R.<x,y,z> = PolynomialRing(QQ,3) ideal = R.ideal([(1+x)^2-y, x^3-z]) list(ideal.elimination_ideal([x]).gens()), e=3 here.
On 30 December 2010 15:51, Alasdair <amc...@gmail.com> wrote: > Can you provide the context for this question? Where does it come up? > > -Alasdair > > On Dec 30, 9:01 pm, Santanu Sarkar <sarkar.santanu....@gmail.com> > wrote: > > 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 sage-support@googlegroups.com > To unsubscribe from this group, send email to > sage-support+unsubscr...@googlegroups.com<sage-support%2bunsubscr...@googlegroups.com> > For more options, visit this group at > http://groups.google.com/group/sage-support > URL: http://www.sagemath.org > -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
