High-throughput hardware-efficient digit-serial architecture for field multiplication over GF(2m)

It presents a novel digit-serial architecture for finite field multiplications over GF(2m) defined by irreducible trinomials as field polynomials. The critical path of the proposed structure is reduced, and a saving of m number of XOR gates is achieved by the proposed structure at the final output stage by successive finite field accumulation through T flip-flops instead of using D flip-flops and XOR gates in sequential loop. The proposed design is highly modular, and consists of regular blocks of AND and XOR logic gates. The details of hardware requirement and computational delay of the proposed multiplier have been estimated and compared with those of the existing designs. It is found that the proposed design offers considerably lower area-time complexity compared with the existing designs. The advantage of the proposed design is mainly based on its lower critical path, optimal logic design and 100% hardware utilization efficiency.

[1]  Dieter Gollmann,et al.  Algorithm engineering for public key algorithms , 1989, IEEE J. Sel. Areas Commun..

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

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

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

[5]  C.-L. Wang,et al.  Digit-serial systolic multiplier for finite fields GF(2m) , 1998 .

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

[7]  Chun Pyo Hong,et al.  A Digit-Serial Systolic Multiplier for Finite Fields GF ( 2 m ) , .

[8]  Chang Hoon Kim,et al.  An efficient digit-serial systolic multiplier for finite fields GF(2/sup m/) , 2001, Proceedings 14th Annual IEEE International ASIC/SOC Conference (IEEE Cat. No.01TH8558).

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

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

[11]  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).

[12]  Soonhak Kwon,et al.  A Digit-Serial Multiplier for Finite Field , 2005 .

[13]  Soonhak Kwon,et al.  A fast digit-serial systolic multiplier for finite field GF(2m) , 2005, ASP-DAC '05.

[14]  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..

[15]  Guillermo Morales-Luna,et al.  FPGA implementation of an efficient multiplier over finite fields GF(2/sup m/) , 2005, 2005 International Conference on Reconfigurable Computing and FPGAs (ReConFig'05).

[16]  Nigel P. Smart,et al.  Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series) , 2005 .

[17]  Soonhak Kwon,et al.  A digit-serial multiplier for finite field GF(2/sup m/) , 2005, IEEE Trans. Very Large Scale Integr. Syst..

[18]  M. Anwar Hasan,et al.  Low Complexity Bit-Parallel Multiplier for a Class of Finite Fields , 1998, 2006 International Conference on Communications, Circuits and Systems.

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

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

[21]  Luca Lombardi,et al.  Systolic Formulation for Low-Complexity Serial-Parallel Implementation of Unified Finite Field Multiplication over GF(2 m ) , 2007 .

[22]  Pramod Kumar Meher,et al.  Systolic Formulation for Low-Complexity Serial-Parallel Implementation of Unified Finite Field Multiplication over GF(2m) , 2007, 2007 IEEE International Conf. on Application-specific Systems, Architectures and Processors (ASAP).