Issue No. 10 - October (2009 vol. 58)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2009.70
Arash Hariri , University of Western Ontario, London
Arash Reyhani-Masoleh , University of Western Ontario, London
Multiplication and squaring are main finite field operations in cryptographic computations and designing efficient multipliers and squarers affect the performance of cryptosystems. In this paper, we consider the Montgomery multiplication in the binary extension fields and study different structures of bit-serial and bit-parallel multipliers. For each of these structures, we study the role of the Montgomery factor, and then by using appropriate factors, propose new architectures. Specifically, we propose two bit-serial multipliers for general irreducible polynomials, and then derive bit-parallel Montgomery multipliers for two important classes of irreducible polynomials. In this regard, first we consider trinomials and provide a way for finding efficient Montgomery factors which results in a low time complexity. Then, we consider type-II irreducible pentanomials and design two bit-parallel multipliers which are comparable to the best finite field multipliers reported in the literature. Moreover, we consider squaring using this family of irreducible polynomials and show that this operation can be performed very fast with the time complexity of two XOR gates.
Montgomery multiplication, squaring, finite (or Galois) fields, bit-serial, bit-parallel, trinomials, pentanomials.
A. Reyhani-Masoleh and A. Hariri, "Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m)," in IEEE Transactions on Computers, vol. 58, no. , pp. 1332-1345, 2009.