Square Root Computation In Finite Fields

From MaRDI portal




Abstract: In this paper, we discuss three widely-used practical square root algorithms. We present a method where each of these well-known algorithms can be seen as a special case of it. The method 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.












This page was built for publication: Square Root Computation In Finite Fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6506077)