%0 Journal Article
%T Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
%J The ISC International Journal of Information Security
%I Iranian Society of Cryptology
%Z 2008-2045
%A Rashidi, B.
%A Rezaeian Farashahi, R.
%A Sayedi, S. M.
%D 2015
%\ 09/02/2015
%V 7
%N 2
%P 101-114
%! Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
%K Bit-parallel Multiplier
%K Elliptic Curve Cryptography
%K Trinomials
%K Pentanomials
%K pipelining
%R 10.22042/isecure.2016.7.2.3
%X This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The parallel computation provides regular and low-cost structure with low critical path delay. In addition, the pipelining technique is applied to the proposed structures to shorten the critical path and to perform the computation in two clock cycles. The implementations of the proposed methods over the binary extension fields GF (2163) and GF (2233) have been successfully verified and synthesized using Xilinx ISE 11 by Virtex-4, XC4VLX200 FPGA.
%U http://www.isecure-journal.com/article_39209_81c33c86c4f60accd6de5e48d763c95f.pdf