In this paper, the design and circuit implementation of a polynomial basis multiplier architecture over Galois Fields GF(2m) is presented. The proposed architecture supports field multiplication of two m-term polynomials where m is a positive integer. Circuit implementations based on this parameterized architecture where m is configurable is suitable for applications in error control coding and cryptography. The proposed architecture offers low latency, polynomial basis multiplication where the irreducible polynomial P(x) = x m + p kt . x kt + … + p 1. x + 1 with m ≥ kt + 4 is dynamically reconfigurable. Results of the complexity analysis show that the proposed architecture requires less logic resources compared to existing sequential polynomial basis multipliers. In terms of timing performance, the proposed architecture has a latency of m/4, which is the lowest among the multipliers found in literature for GF(2m).
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Menezes, A. J., Blake, I. F., Gao, X., Mullen, R. C., Vanstone, S. A., & Yaghoobian, T. (1993). Applications of finite fields. Boston: Kluwer Academic Publishers.
Lidl, R., & Niederreiter, H. (1994). Introduction to finite fields and their applications. New York: Cambridge University Press.
Leboeuf, K., Namin, A. H., Wu, H., Muscedere, R., & Ahmadi, M. (2010). Efficient VLSI implementation of a finite field multiplier using reordered normal basis. Proc. of the 53rd IEEE International Midwest Symposium on Circuits and Systems MWSCAS, pp. 1218–1221.
Chiou, C. W., Liang, W.-Y., Chang, H. W., Lin, J.-M., & Lee, C.-Y. (2010). Concurrent error detection in semi-systolic dual basis multiplier over GF(2m) using self-checking alternating logic. IET Journal of Circuits, Devices & Systems, 4(5), 382–391.
Chiou, C.-W., & Jeng, H.-L. (2008). Parallel algorithm for polynomial basis multiplier in GF(2m) fields. Tamkang Journal of Science and Engineering, 11(2), 211–218.
Imaña, J. L. (2011). Low latency GF(2m). Polynomial basis multiplier. IEEE Transactions on Circuits and Systems-I: Regular Papers, 58(5), 935–946.
Reyhani-Masoleh, A., & Hasan, A. (2004). Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m). IEEE Transactions on Computers, 53(8), 945–959.
Meher, P. K. (2009). Systolic and non-systolic scalable modular designs of finite field multipliers for reed–solomon codec. IEEE Transactions on Very Large Scale Integration Systems, 17(6), 747–757.
He, J., Xie, J., & He, M. (2011). Area-efficient systolic multipliers for finite field GF(2m) based on irreducible trinomial. Journal of Convergence Information Technology, 6(5), 305–313.
Ho, H., Szwarc, V., & Kwasniewski, T. (2010). Low complexity reconfigurable DSP circuit implementations based on common sub-expression elimination. Journal of Signal Processing Systems for Signal, Image and Video Technology, 61(3), 353–365.
About this article
Cite this article
Ho, H. Design and Implementation of a Polynomial Basis Multiplier Architecture Over GF(2m). J Sign Process Syst 75, 203–208 (2014). https://doi.org/10.1007/s11265-013-0791-x
- Finite fields
- Polynomial basis
- Low latency
- Hardware implementations