Issue No. 02 - February (1997 vol. 46)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.565591
<p><b>Abstract</b>—In this paper, exponentiation of a primitive root in GF(2<super><it>m</it></super>) is considered. Signed digit (SD) number representation is used to efficiently represent the exponent and the corresponding algorithms and structures for exponentiation are developed. For primitive multiplications required in exponentiations, extended bidirectional linear feedback shift registers are proposed and used for the cases where the exponent is represented as a binary or a radix-4 SD number. Comparisons are made with other methods on the bases of space, time, and possible power consumption. Since the proposed structures can effectively reduce power and area when implemented in VLSI, they are especially suitable for battery powered portable devices.</p>
Exponentiation, Galois or finite fields, signed digit number, minimal representation, LFSR, primitive root.
Huapeng Wu, M. Anwarul Hasan, "Efficient Exponentiation of a Primitive Root in GF(2m)", IEEE Transactions on Computers, vol. 46, no. , pp. 162-172, February 1997, doi:10.1109/12.565591