- #1

- 21

- 0

Let x

_{1}

^{2}+x

_{2}

^{2}=1 be a unit circle upon a finite field Zp where p is prime. Is there any algorithm which can give all the possible solutions (x

_{1},x

_{2}) an element of Zp*Zp as well as the total number of such solutions? If exists, what is the complexity of it?