Publication 2002 Issue No. 7 - July Abstract - Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis
 This Article Share Bibliographic References Add to: Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb Search Similar Articles Articles by Huapeng Wu
Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis
July 2002 (vol. 51 no. 7)
pp. 750-758
 ASCII Text x Huapeng Wu, "Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis," IEEE Transactions on Computers, vol. 51, no. 7, pp. 750-758, July, 2002.
 BibTex x @article{ 10.1109/TC.2002.1017695,author = {Huapeng Wu},title = {Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis},journal ={IEEE Transactions on Computers},volume = {51},number = {7},issn = {0018-9340},year = {2002},pages = {750-758},doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2002.1017695},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on ComputersTI - Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial BasisIS - 7SN - 0018-9340SP750EP758EPD - 750-758A1 - Huapeng Wu, PY - 2002KW - Finite fields arithmeticKW - hardware architectureKW - polynomial basis.VL - 51JA - IEEE Transactions on ComputersER -

Bit-parallel finite field multiplication using polynomial basis can be realized in two steps: polynomial multiplication and reduction modulo the irreducible polynomial. In this article, we present an upper complexity bound for the modular polynomial reduction. When the field is generated with an irreducible trinomial, closed form expressions for the coefficients of the product are derived in term of the coefficients of the multiplicands. Complexity of the multiplier architectures and their critical path length is evaluated and they are comparable to the previous proposals for the same class of fields. Analytical form for bit-parallel squaring operation is also presented. The complexities for bit-parallel squarer are also derived when an irreducible trinomial is used. Consequently, it is argued that to solve multiplicative inverse using polynomial basis can be at least as good as using normal basis.

[1] V.B. Afanasyev, “On the Complexity of Finite Field Arithmetic,” Proc. Fifth Joint Soviet-Swedish Int'l Workshop Information Theory, pp. 9-12, 1991.
[2] V.B. Afanasyev, C. Gehrmann, and B. Smeets, “Fast Message Authentication Using Efficient Polynomial Avaluation,” Proc Fast Software Encryption Workshop, pp. 109-204, 1997.
[3] G.B. Agnew, T. Beth, R.C. Mullin, and S.A. Vanstone, “Arithmetic Operations in GF$\big. (2^m)\bigr.$.” J. Cryptology, vol. 6, pp. 3-13, 1993.
[4] D.V. Bailey and C. Paar, “Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography,” J. Cryptology, vol. 14, no. 3, pp. 513-176, 2001.
[5] I.F. Blake, S. Gao, and R. Lambert, "Constructive Problems for Irreducible Polynomials Over Finite Fields," Proc. Canadian Workshop Information Theory, pp. 1-23, 1993.
[6] H. Brunner, A. Curiger, and M. Hofstetter, On Computing Multiplicative Inverses in${\rm GF}(2^m)$ IEEE Trans. Computers, vol. 42, no. 8, pp. 1010-1015, Aug. 1993.
[7] 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.
[8] S. Gao and S. Vanstone, “On Orders of Optimal Normal Basis Generators,” Math. Computation, vol. 64, no. 2, pp. 1227-1233, 1995.
[9] 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.
[10] T. Itoh and S. Tsujii, “A Fast Algorithm for Computing Multiplicative Inverses in$GF(2^m)$Using Normal Basis,” Information and Computing, vol. 78, pp. 171-177, 1988.
[11] E.D. Mastrovito, “VLSI Architectures for Computations in Galois Fields,” PhD thesis, Linköping Univ., Linköping, Sweden, 1991.
[12] R.C. Mullin,I.M. Onyszchuk,S.A. Vanstone, and R.M. Wilson,"Optimal Normal Bases inGF(pn)," Discrete Applied Maths., pp. 142-169, 1988/89.
[13] C. Paar, “Efficient VLSI Architectures for Bit-Parallel Computation in Galois Fields,” PhD thesis, Univ. of Essen, Düsseldorf, 1994.
[14] A. Schönhage, “Schnelle Multiplikation von Polynomen uber Korpern der Charakteristik 2,” Acta Informatica, vol. 7, pp. 395-398, 1977.
[15] R. Schroeppel, S. O'Malley, H. Orman, and O. Spatscheck, “A Fast Software Implementation for Arithmetic Operations in GF($2^n$),” Proc. Advances in Cryptology–CRYPTO '95, pp. 43-56, 1995.
[16] I.E. Shparlinski, Computational and Algorithmic Problems in Finite Fields. Kluwer Academic, 1992.
[17] B. Sunar and Ç.K. Koç, Mastrovito Multiplier for All Trinomials IEEE Trans. Computers, vol. 48, no. 5, pp. 522-527, May 1999.
[18] J. von zur Gathen and M. Noecker, “Exponentiation in Finite Fields: Theory and Practice,” Proc. Applicable Algebra in Eng., Comm., and Computing, (AAECC-12), pp. 88-113, 1997.
[19] M. Wang and I.F. Blake,"Bit-Serial Multiplication in Finite Fields," SIAM J. Discrete Maths., vol. 3, pp. 140-148, Feb. 1990.
[20] H. Wu, “Efficient Computations in Finite Fields with Cryptographic Significance,” PhD thesis, Dept. of Electrical and Computer Eng., Waterloo, Ontario, Canada, 1998.
[21] H. Wu, M.A. Hasan, and I.F. Blake, “On Complexity of Bit-Parallel Finite Field Multiplier,” Proc. Canadian Workshop Information Theory '97, 1997.

Index Terms:
Finite fields arithmetic, hardware architecture, polynomial basis.
Citation:
Huapeng Wu, "Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis," IEEE Transactions on Computers, vol. 51, no. 7, pp. 750-758, July 2002, doi:10.1109/TC.2002.1017695