Yayın:
Square root computation in finite fields

Basit öğe sayfası
dc.contributor.authorAdiguzel-Goktas, Ebru
dc.contributor.authorOzdemir, Enver
dc.date.accessioned2026-01-26T04:42:25Z
dc.date.issued2024-03-12
dc.description.abstractAbstractIn 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.
dc.description.urihttps://doi.org/10.1007/s10623-024-01374-1
dc.description.urihttps://dx.doi.org/10.48550/arxiv.2206.07145
dc.description.urihttp://arxiv.org/abs/2206.07145
dc.description.urihttps://zbmath.org/7873232
dc.description.urihttps://hdl.handle.net/20.500.12573/2352
dc.identifier.doi10.1007/s10623-024-01374-1
dc.identifier.eissn1573-7586
dc.identifier.endpage1959
dc.identifier.issn0925-1022
dc.identifier.openairedoi_dedup___::e2f3ad6ebfad04fe205b8dcc177e9bac
dc.identifier.orcid0000-0002-8215-2256
dc.identifier.startpage1947
dc.identifier.urihttps://hdl.handle.net/11527/61122
dc.identifier.volume92
dc.language.isoeng
dc.publisherSpringer Science and Business Media LLC
dc.relation.ispartofDesigns, Codes and Cryptography
dc.rightsOPEN
dc.subjectSingular curves
dc.subjectComputational methods for problems pertaining to field theory
dc.subjectMathematics - Number Theory
dc.subjectQ99
dc.subjectSymbolic computation and algebraic computation
dc.subjectsquare roots
dc.subjectsingular curves
dc.subjectelliptic curves
dc.subjectFOS: Mathematics
dc.subjectElliptic curves
dc.subjectSquare roots
dc.subjectNumber Theory (math.NT)
dc.subjectPrimary 11Y99
dc.subjectNumber-theoretic algorithms
dc.subjectcomplexity
dc.titleSquare root computation in finite fields
dc.typeArticle
dspace.entity.typePublication

Dosyalar

Koleksiyonlar

Yayınlar