Hardware Implementation of Multiplication and Division Operations for Polynomials in Finite Fields

In this paper we prove it is necessary to implement hardware or hardware-software operations in Galois fields. Specifically, we demonstrate that hardware implementation is preferable for multiplication and division operations on polynomials with coefficients that belong to the finite field. It is also feasible to run these operations on separate functional units. We develop formulas that allow skipping summation cycles if the bars being summed contain zero values. Algorithms for evaluating the coefficients as well as the function unit diagram for multiplying and dividing the polynomials in the field are provided. We show that the hardware implementation of these operations in finite fields significantly increases computational efficiency.

Publication year: 
С. 61—66. Іл. 5. Бібліогр.: 12 назв.

1. V. Patel and K.S. Gurumurthy, “Arithmetic operations in Multi-Valued logic”, VLSICS, vol. 1, no. 1, pp. 21—32, 2010.
2. P. Kisos et al., “An efficient reconfigurable multiplier architecture for Galois field GF(2m)”, Microelectronics J., vol. 34, 975—980, 2003.
3. Ch.-Yng Lee and P.K. Meher, “Efficient bit-parallel multipliers over finite fields GF(2m)”, Comput. and Electrical Eng., vol. 36, pp. 955—968, 2010.
4. L. Batina et al., “Hardware architectures for public key cryptography”, Integration, The VLSI J., vol. 34, 2003, pp. 1—64.
5. M. Morales-Sandoval et al., “An area/performance tradeoff analysis of a GF(2m) multiplier architecture for elliptic curve cryptography”, Comput. and Electrical Eng., vol. 35, pp. 54—58, 2009.
6. S. Serdar et al., “Erdem Polynomial Basis Multiplication over GF(2m)”, Acta Appl. Math., pp. 33—55, 2006.
7. H. Wu, “Bit-parallel finite field multiplier and squarer using polynomial basis”, IEEE Trans. Comput., vol. 51, no. 7, pp. 750—758, 2002.

2012-5-10.pdf303.04 KB

Тематичні розділи журналу