Adiguzel-Goktas, EbruOzdemir, Enver2024-08-282024-08-28202409251022https://doi.org/10.1007/s10623-024-01374-1https://hdl.handle.net/20.500.12573/2352In this paper, we present a review of three widely-used practical square root algorithms. We then describe a unifying framework where each of these well-known algorithms can be seen as a special case of it. The framework with singular curves offers a broad perspective to compare and further improve the existing methods in addition to offering a new avenue for square root computation algorithms in finite fields.enginfo:eu-repo/semantics/openAccessSquare rootsSingular curvesElliptic curvesPrimary 11Y9968Q99Square root computation in finite fieldsarticle9219471959