Square root computation in finite fields

Ebru Adiguzel-Goktas*, Enver Ozdemir

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
JournalDesigns, Codes, and Cryptography
DOIs
Publication statusAccepted/In press - 2024

Bibliographical note

Publisher Copyright:
© The Author(s) 2024.

Keywords

  • 68Q99
  • Elliptic curves
  • Primary 11Y99
  • Singular curves
  • Square roots

Fingerprint

Dive into the research topics of 'Square root computation in finite fields'. Together they form a unique fingerprint.

Cite this