On the Computation of Square Roots in Finite Fields

Handbook of applied cryptography

Choice Reviews Online · 1997 · 10.4K citations

Valuable Reference, Cryptographic Primitive, Rapid Access +19

A Survey of Fast Exponentiation Methods

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

Engineering, Validated Numerics, Fast Exponentiation Methods +6

Elliptic curves and primality proving

A. O. L. Atkin, François Morain · Mathematics of Computation · 1993 · 380 citations

Public Key Algorithm, Computational Number Theory, Compositis Dignoscendi +5

Probabilistic Algorithms in Finite Fields

Michael O. Rabin · SIAM Journal on Computing · 1980 · 312 citations

Engineering, Computational Number Theory, Probabilistic System +13

Édouard Lucas and primality testing (Canadian Mathematical Society Series of Monographs and Advanced Texts, Volume 22), by Hugh C. Williams . Pp. 525. £60. 1998. ISBN 0 471 14852 0 (Wiley-Interscience).

The Mathematical Gazette · 1999 · 71 citations