Square Root Computation In Finite Fields

2022/06/14 by Adiguzel-Goktas, Ebru, Ozdemir, Enver · 1 citation
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2206.07145

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.

Cited by

• Optimization of Quadratic Constraints by Decoded Quantum Interferometry

Related

• Adleman-Manders-Miller Root Extraction Method Revisited
• Constructing curves over finite fields with many points by solving linear equations
• Computing e-th roots in number fields
• Discrete logarithms in curves over finite fields
• Selecting polynomials for the Function Field Sieve