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

RE: [PrimeNumbers] Quadratic residue

Expand Messages
  • Paul Jobling
    ... Yes there is. Do a google search for discrete logarithm . Baby steps giant steps and silver pohlig hellman are other useful search terms. Regards,
    Message 1 of 2 , Feb 19, 2004
      > Given a prime p how does one find n such that 2^n+1 %p=0
      >
      > If p=4K+1 then does n have to be k.
      >
      > Is there a method faster than factoring p-1 and then calculating
      > 2^a+1 %p then 2^2*a+1 %p etc...

      Yes there is. Do a google search for "discrete logarithm". "Baby steps giant
      steps" and "silver pohlig hellman" are other useful search terms.

      Regards,

      Paul.


      __________________________________________________
      Virus checked by MessageLabs Virus Control Centre.
    Your message has been successfully submitted and would be delivered to recipients shortly.