Improved generalized Atkin algorithm for computing square roots in finite fields

Recently, S. Müller developed a generalized Atkin algorithm for computing square roots, which requires two exponentiations in finite fields GF ( q ) when q ≡ 9 ( mod 16 ) . In this paper, we present a simple improvement to it and the improved algorithm requires only one exponentiation for half of sq...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters 2006-04, Vol.98 (1), p.1-5
Hauptverfasser:	Kong, Fanyu, Cai, Zhun, Yu, Jia, Li, Daxing
Format:	Artikel
Sprache:	eng
Schlagworte:	Algebra Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Binary system Computational complexity Computer science control theory systems Cryptography Exact sciences and technology Finite field arithmetic Information, signal and communications theory Mathematical models Mathematics Number theory Numbers Sciences and techniques of general use Signal and communications theory Square roots Studies Telecommunications and information theory Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!