Reducing the Complexity of Normal Basis Multiplication

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9061)

Abstract

In this paper we introduce a new transformation method and a multiplication algorithm for multiplying the elements of the field GF\((2^k)\) expressed in a normal basis. The number of XOR gates for the proposed multiplication algorithm is fewer than that of the optimal normal basis multiplication, not taking into account the cost of forward and backward transformations. The algorithm is more suitable for applications in which tens or hundreds of field multiplications are performed before needing to transform the results back.

References

  1. 1.
    Agnew, G.B., Beth, T., Mullin, R.C., Vanstone, S.A.: Arithmetic operations in \({GF}(2^m)\). J. Cryptol. 6(1), 3–13 (1993)CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Agnew, G.B., Mullin, R.C., Onyszchuk, I., Vanstone, S.A.: An implementation for a fast public-key cryptosystem. J. Cryptol. 3(2), 63–79 (1991)CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Agnew, G.B., Mullin, R.C., Vanstone, S.A.: An implementation of elliptic curve cryptosystems over \(F_{2^{155}}\). IEEE J. Sel. Areas Commun. 11(5), 804–813 (1993)CrossRefGoogle Scholar
  4. 4.
    Blake, I., Seroussi, G., Smart, N.: Elliptic Curves in Cryptography. Cambridge University Press, Cambridge (1999)CrossRefMATHGoogle Scholar
  5. 5.
    Erdem, S.S., Yanık, T., Koç, Ç.K.: Polynomial basis multiplication in GF\((2^m)\). Acta Applicandae Mathematicae 93(1–3), 33–55 (2006)CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Gao, S.: Normal bases over finite fields. Ph.D. thesis, University of Waterloo (1993)Google Scholar
  7. 7.
    Gao, S., Lenstra Jr., H.W.: Optimal normal bases. Des. Codes Cryptgr. 2(4), 315–323 (1992)CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    von zur Gathen, J., Shokrollahi, M.A., Shokrollahi, J.: Efficient multiplication using type 2 optimal normal bases. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 55–68. Springer, Heidelberg (2007) CrossRefGoogle Scholar
  9. 9.
    Halbutoǧulları, A., Koç, Ç.K.: Mastrovito multiplier for general irreducible polynomials. IEEE Trans. Comput. 49(5), 503–518 (2000)CrossRefMathSciNetGoogle Scholar
  10. 10.
    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 (1992)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverses in \({GF}(2^m)\) using normal bases. Inf. Comput. 78(3), 171–177 (1988)CrossRefMATHMathSciNetGoogle Scholar
  12. 12.
    Itoh, T., Tsujii, S.: Structure of parallel multipliers for a class of finite fields \({GF}(2^m)\). Inf. Comput. 83, 21–40 (1989)CrossRefMATHMathSciNetGoogle Scholar
  13. 13.
    Koç, Ç.K., Acar, T.: Montgomery multiplication in GF\((2^k)\). Des. Codes Cryptgr. 14(1), 57–69 (1998)CrossRefMATHGoogle Scholar
  14. 14.
    Koç, Ç.K., Acar, T., Kaliski Jr., B.S.: Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro 16(3), 26–33 (1996)CrossRefGoogle Scholar
  15. 15.
    Mastrovito, E.D.: VLSI architectures for multiplication over finite field GF\((2^m)\). In: Mora, T. (ed.) AAECC-6. LNCS, vol. 357, pp. 297–309. Springer, Heidelberg (1988) CrossRefGoogle Scholar
  16. 16.
    Mastrovito, E.D.: VLSI architectures for computation in Galois fields. Ph.D. thesis, Linköping University, Department of Electrical Engineering, Linköping, Sweden (1991)Google Scholar
  17. 17.
    Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519–521 (1985)CrossRefMATHGoogle Scholar
  18. 18.
    Mullin, R., Onyszchuk, I., Vanstone, S., Wilson, R.: Optimal normal bases in \({GF}(p^n)\). Discrete Appl. Math. 22, 149–161 (1988)CrossRefMathSciNetGoogle Scholar
  19. 19.
    Omura, J., Massey, J.: Computational method and apparatus for finite field arithmetic (May 1986). U.S. Patent Number 4,587,627Google Scholar
  20. 20.
    Paar, C.: A new architecture for a parallel finite field multiplier with low complexity based on composite fields. IEEE Trans. Comput. 45(7), 856–861 (1996)CrossRefMATHMathSciNetGoogle Scholar
  21. 21.
    Reyhani-Masoleh, A., Hasan, M.A.: A new construction of Massey-Omura parallel multiplier over GF\((2^m)\). IEEE Trans. Comput. 51(5), 511–520 (2001)CrossRefMathSciNetGoogle Scholar
  22. 22.
    Saldamlı, G.: Spectral modular arithmetic. Ph.D. thesis, Oregon State University (2005)Google Scholar
  23. 23.
    Saldamlı, G., Baek, Y.J., Koç, Ç.K.: Spectral modular arithmetic for binary extension fields. In: The 2011 International Conference on Information and Computer Networks (ICICN), pp. 323–328 (2011)Google Scholar
  24. 24.
    Seroussi, G.: Table of low-weight binary irreducible polynomials (August 1998). Hewlett-Packard, HPL-98-135Google Scholar
  25. 25.
    Silverman, J.H.: Fast multiplication in finite fields GF\((2^n)\). In: Koç, Ç.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 122–134. Springer, Heidelberg (1999) CrossRefGoogle Scholar
  26. 26.
    Sunar, B., Koç, Ç.K.: Mastrovito multiplier for all trinomials. IEEE Trans. Comput. 48(5), 522–527 (1999)CrossRefMATHMathSciNetGoogle Scholar
  27. 27.
    Wu, H., Hasan, M.A.: Low complexity bit-parallel multipliers for a class of finite fields. IEEE Trans. Comput. 47(8), 883–887 (1998)CrossRefMathSciNetGoogle Scholar
  28. 28.
    Zhang, T., Parhi, K.K.: Systematic design of original and modified Mastrovito multipliers for general irreducible polynomials. IEEE Trans. Comput. 50(7), 734–749 (2001)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of California Santa BarbaraSanta BarbaraUSA

Personalised recommendations