Yayın: Square root computation in finite fields
Yükleniyor...
Tarih
Yazarlar
Danışman
Bölüm / Program
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Springer Science and Business Media LLC
Türü
Özet
AbstractIn 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.
Tanım
Dergi veya Seri
Designs, Codes and Cryptography
ISSN
0925-1022
ISBN
Haklar
OPEN
Anahtar Kelimeler
Singular curves, Computational methods for problems pertaining to field theory, Mathematics - Number Theory, Q99, Symbolic computation and algebraic computation, square roots, singular curves, elliptic curves, FOS: Mathematics, Elliptic curves, Square roots, Number Theory (math.NT), Primary 11Y99, Number-theoretic algorithms, complexity