.png){kind=icon}
.png){kind=icon}
Return
Square Root Computation over Even Extension Fields
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2013.145.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a comprehensive study of the computation of square roots over finite extension fields. We propose two novel algorithms for computing square roots over even field extensions of the form F-q2, with q= p(n), an odd prime and n >= 1. Both algorithms have an associate computational cost roughly equivalent to one exponentiation in F-q2. The first algorithm is devoted to the case when q equivalent to 1 mod 4, whereas the second one handles the case when q equivalent to 3 and 4. Numerical comparisons show that the two algorithms presented in this paper are competitive and in some cases more efficient than the square root methods previously known.
Keywords:
Modular square root
finite field arithmetic
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K