Improved generalized Atkin algorithm for computing square roots in finite fields

Encyclopedia of Mathematics and its Applications.

Y. L. L., William B. Jones, W. J. Thron · Mathematics of Computation · 1982 · 4.1K citations

Spectral Theory, Theoretical Mathematics, Geometry Of Number +2

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

Toshiya Itoh, Shigeo Tsujii · Information and Computation · 1988 · 634 citations

Normal Bases, Fast Algorithm, Computational Number Theory +4

A Survey of Fast Exponentiation Methods

Daniel M. Gordon · Journal of Algorithms · 1998 · 532 citations

Engineering, Validated Numerics, Fast Exponentiation Methods +6

Counting points on elliptic curves over finite fields

René Schoof · Journal de Théorie des Nombres de Bordeaux · 1995 · 359 citations

Geometry Of Number, Engineering, Computational Number Theory +9

On the Computation of Square Roots in Finite Fields

Siguna Müller · Designs Codes and Cryptography · 2004 · 39 citations

Applied Algebra, Finite Field, Square Roots +1