This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Exponentiation of a Primitive Root in GF(2m)
February 1997 (vol. 46 no. 2)
pp. 162-172

Abstract—In this paper, exponentiation of a primitive root in GF(2m) 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.

[1] W. Diffie and M.E. Hellman, New Directions in Cryptography IEEE Trans. Information Theory, vol. 22, pp. 644-654, 1976.
[2] G.B. Agnew, R.C. Mullin, I. Onyszchuk, and S.A. Vanstone, "An Implementation for a Fast Public Key Cryptosystem," J. Cryptology, vol. 3, pp. 63-79 1991.
[3] D.W. Ash, I.F. Blake, and S.A. Vanstone, “Low Complexity Normal Bases,” Discrete Applied Math., vol. 25, pp. 191-210, 1989.
[4] A. Avizienis, "Signed-Digit Number Representations for Fast Parallel Arithmetic," IRE Trans. Electronic Computers, vol. 10, pp. 389-400, 1961.
[5] G.W. Reitwiesner, "Binary Arithmetic," Advanced Computers 1, pp. 232-308 Academic Press, 1960.
[6] H.L. Garner, "Number Systems and Arithmetic," Advanced Computers 6, pp. 131-194. Academic Press, 1965.
[7] A.D. Booth, "A Signed Binary Multiplication Technique," Quarterly J. Mechanical and Applied Math., vol. 4, Pt. 2, pp. 236-240, 1951.
[8] B. Parhami, "Generalized Signed-Digit Number Systems: A Unifying Framework for Redundant Number Representations," IEEE Trans. Computers, vol. 39, no. 1, pp. 89-98, Jan. 1990.
[9] W.E. Clark and J.J. Liang, On Arithmetic Weight for a General Radix Representation of Integers IEEE Trans. Information Theory, vol. 19, no. 6, pp. 823-826, 1973.
[10] S. Arno and F.S. Wheeler, Signed Digit Representations of Minimal Hamming Weight IEEE Trans. Computers, vol. 42, no. 8, pp. 1007-1010, Aug. 1993.
[11] C.S. Wallace, "A Suggestion for a Fast Multiplier," IEEE Trans. Electronic Computers, vol. 14, no. 1, pp. 14-17, Feb. 1964.
[12] D.E. Atkins, "Design of the Arithmetic Units of Illiac III: Use of Redundancy and Higher Radix Methods," IEEE Trans. Computers, vol. 9, no. 8, pp. 720-733, Aug. 1970.
[13] K. Hwang, Computer Arithmetic.New York: Wiley, 1979.
[14] J. Jedwab and C.J. Mitchell, Minimum Weight Modified Signed-Digit Representations and Fast Exponentiation Electronics Letters, vol. 25, no. 17, pp. 1171-1172, 1989.
[15] E.F. Brickell, D.M. Gordon, K.S. McCurley, and D.B. Wilson, "Fast Exponentiation with Precomputation (Extended Abstract)," Proc. EUROCRYPT '92 pp. 200-207, LNCS 658, Springer Verlag, 1992.
[16] T. Beth, B.M. Cook, and D. Gollmann, "Architectures for Exponentiation in GF(2n)," Advances in Cryptology-CRYPTO '86, pp. 302-310, LNCS 263.
[17] P.A. Scott, S.J. Simmons, S.E. Tavares, and L.E. Peppard, Architectures for Exponentiation in$GF(2^m)$ IEEE J. Selected Areas in Comm., vol. 6, no. 3, pp. 578-586, Apr. 1988.
[18] E.D. Mastrovito, "VLSI Architectures for Computations in Galois Fields," PhD dissertation, Linköping Univ., Linköping, Sweden, 1991.
[19] B. Arazi, "Architectures for Exponentiation Over GF(2m) Adopted for Smartcard Application," IEEE Trans. Computers, vol. 42, no. 4, pp. 494-497, Apr. 1993.
[20] M.A. Hasan and V.K. Bhargava, "Architecture for a Low Complexity Rate-Adaptive Reed-Solomon Encoder," IEEE Trans. Computers, vol. 44, no. 7, pp. 938-942, July 1995.
[21] C. Paar, "Efficient VLSI Architectures for Bit-Parallel Computation in Galois Fields," PhD dissertation, Informatik Kommunikationstechnik, VDI-Verlag, Düsseldorf, 1994.
[22] M.A. Hasan, M.Z. Wang, and V.K. Bhargava, “A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields,” IEEE Trans. Computers, vol. 42, no. 10, pp. 1278-1280, Oct. 1993.
[23] M.A. Hasan, M. Wang, and V.K. Bhargava, Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields$GF(2^m)$ IEEE Trans. Computers, vol. 41, no. 8, pp. 962-971, Aug. 1992.
[24] J.A. Gordon, "Very Simple Method to Find the Minimal Polynomial of an Arbitrary Nonzero Element of a Finite Field," Electronics Letters, vol. 12, pp. 663-664, 1976.
[25] C.C. Wang and D. Pei, "A VLSI Design for Computing Exponentiation in GF(2m) and Its Application to Generate Pseudorandom Number Sequences," IEEE Trans. Computers, vol. 39, no. 2, pp. 258-262, Feb. 1990.
[26] I.F. Blake, X. Gao, R.C. Mullin, S.A. Vanstone, and T. Yaghoobian, Applications of Finite Fields, A.J. Menezes, ed. Kluwer Academic, 1993.

Index Terms:
Exponentiation, Galois or finite fields, signed digit number, minimal representation, LFSR, primitive root.
Citation:
Huapeng Wu, M. Anwarul Hasan, "Efficient Exponentiation of a Primitive Root in GF(2m)," IEEE Transactions on Computers, vol. 46, no. 2, pp. 162-172, Feb. 1997, doi:10.1109/12.565591
Usage of this product signifies your acceptance of the Terms of Use.