A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
On Calculating Square Roots in GF(p)
[article]
2016
arXiv
pre-print
This article presents a new method for calculating square roots in GF(p) by exponentiating in GF(p^3) or equivalently modulo irreducible cubic polynomials. This algorithm is in some ways similar to the Cipolla-Lehmer algorithm which is based on exponentiating in GF(p^2). Another less well known square root algorithm based on quadratic sums is also given. In addition to this, several conjectures about the output of this GF(p^3) square root algorithm are mentioned.
arXiv:1309.2831v3
fatcat:cbsiksh4pjf23ou6bt5xy6erw4