Square Root Computation in Finite Fields
Square Root Computation in Finite Fields
Abstract
In 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.
Description
Keywords
Square Roots, Singular Curves, Elliptic Curves, 68Q99, Primary 11Y99, Singular curves, Mathematics - Number Theory, 68Q99, FOS: Mathematics, Elliptic curves, Square roots, Number Theory (math.NT), Primary 11Y99, Computational methods for problems pertaining to field theory, Symbolic computation and algebraic computation, square roots, singular curves, elliptic curves, Number-theoretic algorithms; complexity
Fields of Science
0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 0101 mathematics, 01 natural sciences
Citation
WoS Q
Scopus Q
OpenCitations Citation Count
1
Volume
92
Issue
7
Start Page
1947
End Page
1959