TY - JOUR
ID - 39209
TI - Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
JO - The ISC International Journal of Information Security
JA - ISECURE
LA - en
SN - 2008-2045
AU - Rashidi, B.
AU - Rezaeian Farashahi, R.
AU - Sayedi, S. M.
AD - Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran
AD - Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, Iran
AD - School of Mathematics, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran
Y1 - 2015
PY - 2015
VL - 7
IS - 2
SP - 101
EP - 114
KW - Bit-parallel Multiplier
KW - Elliptic Curve Cryptography
KW - Trinomials
KW - Pentanomials
KW - pipelining
DO - 10.22042/isecure.2016.7.2.3
N2 - 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.
UR - http://www.isecure-journal.com/article_39209.html
L1 - http://www.isecure-journal.com/article_39209_81c33c86c4f60accd6de5e48d763c95f.pdf
ER -