This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Low Complexity Bit-Parallel Multiplier for GF(2^m) Defined by All-One Polynomials Using Redundant Representation
December 2005 (vol. 54 no. 12)
pp. 1628-1630
This paper presents a new bit-parallel multiplier for the finite field GF(2^m) defined by an irreducible all-one polynomial. In order to reduce the complexity of the multiplier, we introduce a redundant representation and use the well-known multiplication method proposed by Karatsuba. The main idea is to combine the redundant representation and the Karatsuba method to design an efficient bit-parallel multiplier. As a result, the proposed multiplier requires about 25 percent fewer AND/XOR gates than the previously proposed multipliers using an all-one polynomial, while it has almost the same time delay as the previously proposed ones.

[1] M. Ciet, J.J. Quisquater, and F. Sica, “ A Secure Family of Composite Finite Fields Suitable for Fast Implementation of Elliptic Curve Cryptography,” Proc. Int'l Conf. Cryptology in India (INDOCRYPT 2001), pp. 108-116, 2001.
[2] G. Drolet, “A New Representation of Elements of Finite Fields $GF(2^m)$ Yielding Small Complexity Arithmethic Circuits,” IEEE Trans. Computers, vol. 47, no. 9, pp. 938-946, Sept. 1998.
[3] W. Geiselmann and R. Steinwandt, “ A Redundant Representation of $GF(q^n)$ for Designing Arithmetic Circuits,” IEEE Trans. Computers, vol. 52, no. 7, pp. 848-853, July 2003.
[4] 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.
[5] T. Itoh and S. Tsujii, “Structure of Parallel Multiplications for a Class of Fileds $GF(2^m)$ ,” Information and Computers, vol. 83, pp. 21-40, 1989.
[6] D.E. Knuth, The Art of Computer Programming, vol. 2. Addison Wesley, 1998.
[7] C.H. Kim, S. Oh, and J. Lim, “A New Hardware Architecture for Operations in $GF(2^n)$ ,” IEEE Trans. Computers, vol. 51, no. 1, pp. 90-92, Jan. 2002.
[8] C.K. Koc 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.
[9] M. Leone, “A New Low Complexity Parallel Multiplier for a Class of Finite Fields,” Proc. Cryptographic Hardware and Embedded Systems (CHES 2001), pp. 160-170, 2001.
[10] R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications. New York: Cambridge Univ. Press, 1994.
[11] C.-Y. Lee, E.-H. Lu, and J.-Y. Lee, “Bit-Parallel Systolic Multipliers for $GF(2^m)$ Fields Defined by All-One and Equally Spaced Polynomials,” IEEE Trans. Computers, vol. 50, no. 5, pp. 385-393, May 2001.
[12] A.J. Menezes, I.F. Blake, X. Gao, R.C. Mullin, S.A. Vanstone, and T. Yaghoobian, Applications of Finite Fields. Kluwer Academic, 1993.
[13] A.J. Menezes, P.C. Oorschot, and S.A. Vanstone, Handbook of Applied Cryptography. CRC Press, 1997.
[14] M. Elia, M. Leone, and C. Visentin, “Low Complexity Bit-Parallel Multipliers for with Generator Polynomial $x^m + x^k+1$ ,” Electronic Letters, vol. 35, no. 7, pp. 551-552, Apr. 1999.
[15] J. Omura and J. Massey, “Computational Method and Apparatus for Finite Field Arithmetic,” US Patent Number 4,587,627, May 1986.
[16] A. Reyhani-Masoleh and M.A. Hasan, “A New Construction of Massey-Omura Parallel Multiplier over $GF(2^m)$ ,” IEEE Trans. Computers, vol. 51, no. 5, pp. 511-520, May 2002.
[17] A. Reyhani-Masoleh and M.A. Hasan, “Efficient Multiplication beyond Optimal Normal Bases,” IEEE Trans. Computers, vol. 52, no. 4, pp. 428-439, Apr. 2003.
[18] J.H. Silverman, “Fast Multiplication in Finite Fields $GF(2^N)$ ,” Proc. Cryptographic Hardware and Embedded Systems (CHES 1999), pp. 122-134, 1999.
[19] N. Takagi, J.-I. Yoshiki, and K. Takagi, “ A Fast Algorithm for Multiplicative Inversion in $GF(2^m)$ Using Normal Basis,” IEEE Trans. Computers, vol. 50, no. 5, pp. 394-398, May 2001.
[20] 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.
[21] H. Wu, M.A. Hasan, I.F. Blake, and S. Gao, “Finite Field Multiplier Using Redundant Representation,” IEEE Trans. Computers, vol. 51, no. 11, pp. 1306-1316, Nov. 2002.

Index Terms:
Index Terms- Bit-parallel multiplier, redundant representation, finite field arithmetic, AOP, Karatsuba method.
Citation:
Ku-Young Chang, Dowon Hong, Hyun-Sook Cho, "Low Complexity Bit-Parallel Multiplier for GF(2^m) Defined by All-One Polynomials Using Redundant Representation," IEEE Transactions on Computers, vol. 54, no. 12, pp. 1628-1630, Dec. 2005, doi:10.1109/TC.2005.199
Usage of this product signifies your acceptance of the Terms of Use.