This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Bit-Parallel Systolic Multipliers for GF(2m) Fields Defined by All-One and Equally Spaced Polynomials
May 2001 (vol. 50 no. 5)
pp. 385-393

Abstract—Two operations, the cyclic shifting and the inner product, are defined by the properties of irreducible all one polynomials. An effective algorithm is proposed for computing multiplications over a class of fields $GF(2^m)$ using the two operations. Then, two low-complexity bit-parallel systolic multipliers are presented based on the algorithm. The first multiplier is composed of $(m+1)^2$ identical cells, each consisting of one 2-input AND gate, one 2-input XOR gate, and three 1-bit latches. The other multiplier comprises of $(m+1)^2$ identical cells and mXOR gates. Each cell consists of one 2-input AND gate, one 2-input XOR gate, and four 1-bit latches. Each multiplier exhibits very low latency and propagation delay and is thus very fast. Moreover, the architectures of the two multipliers can be applied in computing multiplications over the class of fields $GF(2^m)$ in which the elements are represented with the root of an irreducible equally spaced polynomial of degree m.

[1] E.R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
[2] D.E.R. Denning, Cryptography and Data Security. Addison-Wesley, 1983.
[3] A. Odlyzko, "Discrete Logarithms in Finite Fields and Their Cryptographic Significance," Lecture Notes in Computer Science 209, pp. 224-316.Berlin: Springer-Verlag, 1984.
[4] W. Diffe and M. Hellman, “New Directions in Cryptography,” IEEE Trans. Information Theory, vol. 22, pp. 644-654, 1976.
[5] C.S. Yeh, S. Reed, and T.K. Truong, “Systolic Multipliers for Finite Fields$GF(2^m)$,” IEEE Trans. Computers, vol. 33, no. 4, pp. 357-360, Apr. 1984.
[6] S.W. Wei, “A Systolic Power-Sum Circuit for$GF(2^m)$,” IEEE Trans. Computers, vol. 43, no. 2, pp. 226-229, Feb. 1994.
[7] C.L. Wang, “Bit-Level Systolic Array for Fast Exponentiation in$GF(2^m)$,” IEEE Trans. Computers, vol. 43, no. 7, pp. 838-841, July 1994.
[8] J.J. Wonziak, “Systolic Dual Basis Serial Multiplier,” IEE Proc. Computers and Digital Technology, vol. 145, no. 3, pp. 237-241, May 1998.
[9] T. Itoh and S. Tsujii, “Structure of Parallel Multipliers for a Class of Finite Fields$GF(2^m)$,” Information and Computation, vol. 83, pp. 21-40, 1989.
[10] 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.
[11] Ç.K. Koç and B. Sunar, Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields IEEE Trans. Computers, vol. 47, no. 3, pp. 353-356, Mar. 1998.
[12] H. Wu and M.A. Hasan, "Low Complexity Bit-parallel Multipliers for a Class of Finite Fields," IEEE Trans. Computers, vol. 47, no. 8, pp. 883-887, Aug. 1998.
[13] H. Wu, M.A. Hasan, and I.F. Blake, New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases IEEE Trans. Computers, vol. 47, no. 11, pp. 1223-1233, Nov. 1998.
[14] G. Drolet, “A New Representation of Elements of Finite Fields$\big. {\rm GF}(2^m)\bigr.$Yielding Small Complexity Arithmetic Circuits,” IEEE Trans. Computers, vol. 47, no. 9, pp. 938-946, Sept. 1998.

Index Terms:
Bit-parallel systolic multiplier, finite field, AOP, ESP.
Citation:
Chiou-Yng Lee, Erl-Huei Lu, Jau-Yien Lee, "Bit-Parallel Systolic Multipliers for GF(2m) Fields Defined by All-One and Equally Spaced Polynomials," IEEE Transactions on Computers, vol. 50, no. 5, pp. 385-393, May 2001, doi:10.1109/12.926154
Usage of this product signifies your acceptance of the Terms of Use.