Loading ...
Sorry, an error occurred while loading the content.

Re: single frobenius and double fermat

Expand Messages
  • djbroadhurst
    ... Not really. Sticking in powers of 2 does not make forgery any harder. {tst(n,x)=kronecker(x^2-4,n)==-1&&gcd(x,n)==1&&
    Message 1 of 24 , Dec 12, 2012
    • 0 Attachment
      --- In primenumbers@yahoogroups.com,
      "paulunderwooduk" <paulunderwood@...> wrote:

      > I am going to be even more devious

      Not really. Sticking in powers of 2 does not
      make forgery any harder.

      {tst(n,x)=kronecker(x^2-4,n)==-1&&gcd(x,n)==1&&
      Mod(4*(x-2),n)^((n-1)/2)==kronecker(x-2,n)&&
      Mod(4*(x+2),n)^((n-1)/2)==kronecker(x+2,n)&&
      Mod(Mod(1,n)*2*(L^2-4),L^2-x*L+1)^(n+1)==4*(25-4*x^2);}

      {if(tst(115886944289,3692152318),print(fooled));}

      fooled

      David
    Your message has been successfully submitted and would be delivered to recipients shortly.