Systolic Formulation for Low-Complexity Serial-Parallel Implementation of Unified Finite Field Multiplication over GF(2m)

It presents a high-throughput hardware-efficient semi-systolic linear array for a serial-parallel implementation of finite field multiplier over GF(2m) using bidirectional modulo reduction technique. Necessary recurrence relations are formulated and a pair of dependence graphs (DG) are designed for least significant bit (LSB) and most significant bit (MSB) elimination algorithms for modular reduction. Both the DGs are merged together and mapped into a fully-pipelined linear array architecture consisting of to number of processing elements (PEs), which performs one field multiplication in every (m/2) cycles. The structure of each PE is optimized further to be implemented by a pair of AND gates, three XOR gates and a pair of latches. The duration of a cycle amounts to T = TA + Tx3 + TL, where TA,Tx3 and TL, are respectively the delays of a 2-input AND gate, a three-input XOR gate and a latch. The proposed design is found to have significantly low area-time complexity compared with the existing serial-parallel structures for finite filed multiplications. It is shown that the proposed multiplier can also be used for the Montgomery multiplication in binary field.

[1]  Huapeng Wu.  Low Complexity Bit-Parallel Multiplier for a Class of Finite Fields , 2006, ICCCAS 2006.

[2]  B. Preneel,et al.  Serial multiplier architectures over GF(2/sup n/) for elliptic curve cryptosystems , 2004, Proceedings of the 12th IEEE Mediterranean Electrotechnical Conference (IEEE Cat. No.04CH37521).

[3]  T. Acar,et al.  Montgomery Multiplication in Gf2 , 1998 .

[4]  M. K. Ibrahim,et al.  New low complexity bidirectional systolic structures for serial multiplication over the finite field GF(qm) , 1998 .

[5]  Jaemin Park,et al.  Fast VLSI arithmetic algorithms for high-security elliptic curve cryptographic applications , 2001, IEEE Trans. Consumer Electron..

[6]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

[7]  A. P. Chandrakasan,et al.  An energy-efficient reconfigurable public-key cryptography processor , 2001, IEEE J. Solid State Circuits.

[8]  José Luis Imaña,et al.  Bit-parallel finite field multipliers for irreducible trinomials , 2006, IEEE Transactions on Computers.

[9]  James F. Epperson,et al.  An Introduction to Numerical Methods and Analysis , 2001 .

[10]  ÇETIN K. KOÇ,et al.  Montgomery Multiplication in GF(2k) , 1998, Des. Codes Cryptogr..

[11]  Huapeng Wu,et al.  VLSI implementation of bit-parallel word-serial multiplier in GF(2/sup 233/) , 2005, The 3rd International IEEE-NEWCAS Conference, 2005..

[12]  Keshab K. Parhi,et al.  Efficient semisystolic architectures for finite-field arithmetic , 1998, IEEE Trans. Very Large Scale Integr. Syst..

[13]  M. Anwar Hasan,et al.  Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m) , 2004, IEEE Transactions on Computers.

[14]  Keshab K. Parhi,et al.  Efficient finite field serial/parallel multiplication , 1996, Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96.

[15]  Keshab K. Parhi,et al.  Low-Energy Digit-Serial/Parallel Finite Field Multipliers , 1998 .

[16]  Christof Paar,et al.  Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes , 2002, Des. Codes Cryptogr..

[17]  Huapeng Wu,et al.  Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis , 2002, IEEE Trans. Computers.

[18]  Ian F. Blake,et al.  Elliptic curves in cryptography , 1999 .