Square Root Computation in Finite Fields
Loading...
Date
2024
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Open Access Color
HYBRID
Green Open Access
Yes
OpenAIRE Downloads
30
OpenAIRE Views
108
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Average
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
Q2
Scopus Q
Q3
OpenCitations Citation Count
N/A
Source
Designs Codes and Cryptography
Volume
92
Issue
7
Start Page
1947
End Page
1959
PlumX Metrics
Citations
Scopus : 0
Captures
Mendeley Readers : 3
Page Views
5
checked on Apr 18, 2026
Google Scholar™
