A bit-serial word-parallel finite field multiplier using redundant basis in F 2 M

A high speed bit-serial word-parallel finite field multiplier using redundant basis is proposed. It has been shown that the proposed architecture has higher speed compared to the previously proposed hybrid architectures using the same basis while having moderate complexity. The hybrid architecture of the proposed design provides designer the ability to set the trade off between area and delay during the design process.

[1]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: List of Symbols , 1986 .

[2]  Huapeng Wu,et al.  High Speed Word-parallel Bit-Serial Normal Basis Finite Field Multiplier and Its FPGA Implementation , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..

[3]  Alfred Menezes,et al.  Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

[4]  Rudolf Lide,et al.  Finite fields , 1983 .

[5]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[6]  Ian F. Blake,et al.  Finite Field Multiplier Using Redundant Representation , 2002, IEEE Trans. Computers.

[7]  Huapeng Wu,et al.  A New Finite-Field Multiplier Using Redundant Representation , 2008, IEEE Transactions on Computers.

[8]  Joachim von zur Gathen,et al.  Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract) , 1995, LATIN.

[9]  Joachim von zur Gathen,et al.  Algorithms for Exponentiation in Finite Fields , 2000, J. Symb. Comput..