A Versatile Multi-Input Multiplier over Finite Fields

Multiplication of three elements over finite fields is used extensively in multivariate public key cryptography and solving system of linear equations over finite fields. This contribution shows the enhancements of multiplication of three elements over finite fields by using specific architecture. We firstly propose a versatile multi-input multiplier over finite fields. The parameters of this multiplier can be changed according to the requirement of the users which makes it reusable in different applications. Our evaluation of this multiplier gives optimum choices for multiplication of three elements over finite fields. Implemented results show that we takes 22.062 ns and 16.354 ns to execute each multiplication of three elements over GF ((24)2) based on table look-up and polynomial basis on a FPGA respectively. Experimental results and mathematical proofs clearly demonstrate the improvement of the proposed versatile multiplier over finite fields.

[1]  Arash Reyhani-Masoleh,et al.  A Lightweight High-Performance Fault Detection Scheme for the Advanced Encryption Standard Using Composite Fields , 2011, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[2]  Mohammed Benaissa,et al.  GF(2^m) Multiplication and Division Over the Dual Basis , 1996, IEEE Trans. Computers.

[3]  Muhammad Atif,et al.  Efficient implementation of Gaussian elimination method to recover generator polynomials of convolutional codes , 2009, 2009 International Conference on Emerging Technologies.

[4]  J.-F. Rotge,et al.  Universal Solid 3D Format for High Performance Urban Simulation , 2007, 2007 Urban Remote Sensing Joint Event.

[5]  Hsueh Hsieh.  Fill-in comparisons between Gauss-Jordan and Gaussian eliminations , 1974 .

[6]  Hilarie K. Orman,et al.  Fast Key Exchange with Elliptic Curve Systems , 1995, CRYPTO.

[7]  Sae-Young Chung,et al.  Incremental Gaussian elimination decoding of raptor codes over BEC , 2008, IEEE Communications Letters.

[8]  Xuemei Guo,et al.  Cluster based Routing Scheme for Distributed Regression in Wireless Sensor Networks: Gaussian Eliminations , 2008, 2008 10th IEEE International Conference on High Performance Computing and Communications.

[9]  T J FennSebastian,et al.  GF(2m) Multiplication and Division Over the Dual Basis , 1996 .

[10]  Jean-Pierre David,et al.  A Scalable Architecture for Multivariate Polynomial Evaluation on FPGA , 2009, 2009 International Conference on Reconfigurable Computing and FPGAs.

[11]  Edoardo D. Mastrovito,et al.  VLSI Designs for Multiplication over Finite Fields GF (2m) , 1988, AAECC.

[12]  Christof Paar,et al.  Comparison of arithmetic architectures for Reed-Solomon decoders in reconfigurable hardware , 1997, Proceedings. The 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines Cat. No.97TB100186).

[13]  B. Sunar,et al.  Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[14]  Jintai Ding,et al.  Secure Electronic Voting , 2006, Advances in Information Security.

[15]  Matteo Sereno,et al.  On the fly gaussian elimination for LT codes , 2009, IEEE Communications Letters.

[16]  PaarChristof,et al.  Efficient Multiplier Architectures for Galois Fields GF(24n) , 1998 .

[17]  Christof Paar,et al.  A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields , 1996, IEEE Trans. Computers.

[18]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[19]  Jintai Ding,et al.  Rainbow, a New Multivariable Polynomial Signature Scheme , 2005, ACNS.

[20]  Jintai Ding,et al.  Multivariate Public Key Cryptosystems (Advances in Information Security) , 2006 .

[21]  M.A. Hasan,et al.  New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases , 1998, IEEE Trans. Computers.

[22]  Joachim Rosenthal,et al.  Efficient evaluations of polynomials over finite fields , 2011, 2011 Australian Communications Theory Workshop.

[23]  Christof Paar,et al.  Efficient Multiplier Architectures for Galois Fields GF(2 4n) , 1998, IEEE Trans. Computers.

[24]  M. Anwar Hasan,et al.  Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases , 2007, IEEE Transactions on Computers.

[25]  Jongin Lim,et al.  Efficient Normal Basis Multipliers in Composite Fields , 2000, IEEE Trans. Computers.

[26]  Christof Paar,et al.  A super-serial Galois fields multiplier for FPGAs and its application to public-key algorithms , 1999, Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines (Cat. No.PR00375).