Hi, I need to find square roots in GF(prime). I did it like this: y = sqrt(GF(prime)(ySquare))
So far I am not quite happy with the calculation periods and I would like to know which algorithm is used. In my case is prime % 4 == 1, which is the hardest case to find the square root mod p. I am sage newbie and probably its again only a command that I cant find. I tried sqrt? and similar things, but only got the information that sqrt is a symbolic function. Could somebody tell me which algo is implemented or better how to find the implemented algo. Cheers, Steffen --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
