Square root computation in finite fields

Ebru Adiguzel-Goktas; Enver Ozdemir

doi:10.1007/s10623-024-01374-1

Square root computation in finite fields

Ebru Adiguzel-Goktas^*, Enver Ozdemir

^*Corresponding author for this work

Informatics Institute

Abdullah Gul University

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	1947-1959
Number of pages	13
Journal	Designs, Codes, and Cryptography
Volume	92
Issue number	7
DOIs	https://doi.org/10.1007/s10623-024-01374-1
Publication status	Published - Jul 2024

Bibliographical note

Publisher Copyright:
© The Author(s) 2024.

Keywords

68Q99
Elliptic curves
Primary 11Y99
Singular curves
Square roots

Access to Document

10.1007/s10623-024-01374-1

Cite this

@article{943fd5dcc8ac4e4d8e6c34da2a4c07e7,

title = "Square root computation in finite fields",

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.",

keywords = "68Q99, Elliptic curves, Primary 11Y99, Singular curves, Square roots",

author = "Ebru Adiguzel-Goktas and Enver Ozdemir",

note = "Publisher Copyright: {\textcopyright} The Author(s) 2024.",

year = "2024",

month = jul,

doi = "10.1007/s10623-024-01374-1",

language = "English",

volume = "92",

pages = "1947--1959",

journal = "Designs, Codes, and Cryptography",

issn = "0925-1022",

publisher = "Springer Netherlands",

number = "7",

}

TY - JOUR

T1 - Square root computation in finite fields

AU - Adiguzel-Goktas, Ebru

AU - Ozdemir, Enver

N1 - Publisher Copyright: © The Author(s) 2024.

PY - 2024/7

Y1 - 2024/7

N2 - 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.

AB - 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.

KW - 68Q99

KW - Elliptic curves

KW - Primary 11Y99

KW - Singular curves

KW - Square roots

UR - http://www.scopus.com/inward/record.url?scp=85187433176&partnerID=8YFLogxK

U2 - 10.1007/s10623-024-01374-1

DO - 10.1007/s10623-024-01374-1

M3 - Article

AN - SCOPUS:85187433176

SN - 0925-1022

VL - 92

SP - 1947

EP - 1959

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

IS - 7

ER -

Square root computation in finite fields

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this