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 sa
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 sa
