| dc.contributor.author | Adiguzel-Goktas, Ebru | |
| dc.contributor.author | Ozdemir, Enver | |
| dc.date.accessioned | 2024-08-28T09:10:10Z | |
| dc.date.available | 2024-08-28T09:10:10Z | |
| dc.date.issued | 2024 | en_US |
| dc.identifier.issn | 09251022 | |
| dc.identifier.uri | https://doi.org/10.1007/s10623-024-01374-1 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12573/2352 | |
| dc.description.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. | en_US |
| dc.description.sponsorship | Open access funding provided by the Scientific and Technological Research Council of Türkiye (TÜBITAK). | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | Springer Link | en_US |
| dc.relation.isversionof | 10.1007/s10623-024-01374-1 | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Square roots | en_US |
| dc.subject | Singular curves | en_US |
| dc.subject | Elliptic curves | en_US |
| dc.subject | Primary 11Y99 | en_US |
| dc.subject | 68Q99 | en_US |
| dc.title | Square root computation in finite fields | en_US |
| dc.type | article | en_US |
| dc.contributor.department | AGÜ, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü | en_US |
| dc.contributor.institutionauthor | Adiguzel-Goktas, Ebru | |
| dc.identifier.volume | 92 | en_US |
| dc.identifier.startpage | 1947 | en_US |
| dc.identifier.endpage | 1959 | en_US |
| dc.relation.journal | Designs, Codes, and Cryptography | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
