Successive Square Method
The successive square method is an algorithm to compute
in a finite field
. The first step is to decompose
in successive powers of two,
 |
(1)
|
where
{0,1}" src="http://mathworld.wolfram.com/images/equations/SuccessiveSquareMethod/Inline4.gif" style="height:15px; width:58px" />, which gives
in base 2.
can then be represented as
This term can be computed by successive steps as
For example, to compute
in the finite field
, first decompose
into
, then follow the above steps:
From there, the final answer can be computed as
 |
(13)
|
REFERENCES:
Bressoud, D. and Wagon, S. Computational Number Theory. New York: Key College Publishing, pp. 30-40, 2000.