Skip to main content
Log in

Abstract

In this paper, we describe, analyze and compare various \(GF(2^m)\) multipliers. Particularly, we investigate the standard modular multiplication, the Montgomery multiplication, and the matrix–vector multiplication techniques.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Halbutoğulları, A., Koç, Ç.K.: Mastrovito multipliers for general irreducible polynomials. IEEE Trans. Comput. 49(5), 503–518 (May 2000)

    Article  Google Scholar 

  2. Hasan, M.A., Wang, M.Z., Bhargava, V.K.: Modular construction of low complexity parallel multipliers for a class of finite fields GF(2\(^{m}\)). IEEE Trans. Comput. 41(8), 962–971 (May 1992)

    Article  MathSciNet  Google Scholar 

  3. Itoh, T., Tsujii, S.: Structure of parallel multipliers for a class of finite fields GF(2\(^{m}\)). Inform. and Comput. 83(8), 21–40 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  4. Koç, Ç.K., Acar, T.: Montgomery multiplication in \(GF(2^{k})\). Des. Codes Cryptogr. 14(1), 57–69 (April 1998)

    Article  Google Scholar 

  5. Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University Press, UK (1994)

  6. Mastrovito, E.D.: VLSI designs for multiplication over finite fields over GF(2\(^{m}\)). In: Proc. Sixth Int’l Conf. Applied Algebra, Algebraic Algorithms, and Error Correcting Codes (AAECC-6), pp. 297–309, July 1988

  7. Menezes, A.J.: Applications of Finite Fields. Kluwer, Massachusetts (1994)

  8. Menezes, A.J.: Handbook of Applied Cryptography. CRC, Boca Raton, Florida (1997)

  9. Reyhani-Masoleh, A., Hasan, M.A.: Low complexity bit-parallel architectures for polynomial basis multiplication over GF(\(2^{m}\)). IEEE Trans. Comput. 53(8), 945–959 (August 2004)

    Article  Google Scholar 

  10. Sunar, B., Koç, Ç.K.: Mastrovito multiplier for all trinomials. IEEE Trans. Comput. 48(5), 522–527 (May 1999)

    Article  Google Scholar 

  11. Wu, H., Hasan, M.A.: Low-complexity bit-parallel multipliers for a class of finite fields. IEEE Trans. Comput. 47(8), 883–887 (Aug. 1998)

    Article  MathSciNet  Google Scholar 

  12. Wu, H.: Montgomery multiplier and squarer for a class of finite fields. IEEE Trans. Comput. 51(5), 521–529 (May 2002)

    Article  Google Scholar 

  13. Wu, H.: Bit-parallel finite field multiplier and squarer using polynomial basis. IEEE Trans. Comput. 51(7), 750–758 (July 2002)

    Google Scholar 

  14. Zhang, T., Parhi, K.K.: Systematic design of original and modified Mastrovito multipliers for general irreducible polynomials. IEEE Trans. Comput. 50(7), 734–749 (July 2001)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Serdar S. Erdem.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Erdem, S.S., Yanık, T. & Koç, Ç.K. Polynomial Basis Multiplication over GF(2m). Acta Appl Math 93, 33–55 (2006). https://doi.org/10.1007/s10440-006-9047-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10440-006-9047-0

Mathematics Subject Classifications (2000)

Key words

Navigation