Improved generalized Atkin algorithm for computing square roots in finite fields

Authors:
Fanyu Kong;Zhun Cai;Jia Yu;Daxing Li
Affiliations:
Institute of Network Security, Shandong University, Jinan 250100, Shandong, PR China;Institute of Network Security, Shandong University, Jinan 250100, Shandong, PR China;Institute of Network Security, Shandong University, Jinan 250100, Shandong, PR China;Institute of Network Security, Shandong University, Jinan 250100, Shandong, PR China
Venue:
Information Processing Letters
Year:
2006

Citing 7
Cited 3

A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases

Information and Computation
A course in computational algebraic number theory

A course in computational algebraic number theory
Finite fields

Finite fields
A survey of fast exponentiation methods

Journal of Algorithms
Efficient Algorithms for Pairing-Based Cryptosystems

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
On the Computation of Square Roots in Finite Fields

Designs, Codes and Cryptography
A note on square roots in finite fields

IEEE Transactions on Information Theory

Time-varying square roots finding via Zhang dynamics versus gradient dynamics and the former's link and new explanation to Newton-Raphson iteration

Information Processing Letters
A family of implementation-friendly BN elliptic curves

Journal of Systems and Software
A Complete Generalization of Atkin's Square Root Algorithm

Fundamenta Informaticae

Quantified Score

Hi-index	0.89

Visualization

Abstract

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