Results 211 to 220 of about 4,584,642 (232)

Hybrid Digit-Serial Multiplier for Shifted Polynomial Basis of GF(2 m )

Advances in Intelligent Systems and Computing, 2014
Recently, a shifted polynomial basis is a variation of polynomial basis representation. Such kind basis provides better performance in designing bit-parallel and subquadratic space complexity multipliers over binary extension fields. In this paper, we study a new shifted polynomial basis multiplication algorithm to implement a hybrid digit-serial ...
Chiou-Yng Lee, Che Wun Chiou
exaly   +2 more sources

Fast Bit-Parallel Shifted Polynomial Basis Multiplier Using Weakly Dual Basis Over GF(2^(m))

IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2011
In this paper, we present a new method to compute the Mastrovito matrix for GF(2m) generated by an arbitrary irreducible polynomial using weakly dual basis of shifted polynomial basis. In particular, we derive the explicit formulas of the proposed multiplier for special type of irreducible pentanomial xm+xk3+xk2+xk1+1 with k1
Ku-Young Chang, Sun-Mi Park
exaly   +3 more sources

Efficient Bit-Parallel Multiplier for Irreducible Pentanomials Using a Shifted Polynomial Basis

IEEE Transactions on Computers, 2006
In this paper, we present a bit-parallel multiplier for GF(2m ) defined by an irreducible pentanomial xm+xk 3 +xk 2+xk 1+1, where 1lesk 1 lesk2 lesk3 lesm/2. In order to design an efficient, bit-parallel multiplier, we introduce a shifted polynomial basis and modify a reduction matrix presented by Reyhani-Masoleh and Hasan.
Ku-Young Chang, Dowon Hong, Sun-Mi Park
exaly   +3 more sources

Digit-Level Semi-Systolic and Systolic Structures for the Shifted Polynomial Basis Multiplication Over Binary Extension Fields

IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2011
Finite field multiplication is one of the most important operations in the finite field arithmetic. In this paper, we study semi-systolic and systolic implementations of the shifted polynomial basis multiplication and propose low time complexity semi-systolic and systolic array structures.
Arash Reyhani-Masoleh
exaly   +2 more sources

Digit-Serial Structures for the Shifted Polynomial Basis Multiplication Over Binary Extension Fields

Lecture Notes in Computer Science, 2008
Finite field multiplication is one of the most important operations in the finite field arithmetic. Recently, a variation of the polynomial basis, which is known as the shifted polynomial basis, has been introduced. Current research shows that this new basis provides better performance in designing bit-parallel and subquadratic space complexity ...
Arash Reyhani-Masoleh
exaly   +2 more sources

Bit-Parallel GF(2n) Squarer Using Shifted Polynomial Basis. [PDF]

IACR Cryptol. ePrint Arch., 2012
We present explicit formulae and complexities of bit-parallel shifted polynomial basis (SPB) squarers in finite field $GF(2^{n})$s generated by general irreducible trinomials $x^{n}+x^{k}+1$ ($0< k
Xi Xiong, Haining Fan
core   +3 more sources

Formulas for Cube Roots in F3m Using Shifted Polynomial Basis

Information Processing Letters, 2014
Seokhie Hong, Nam Su Chang
exaly   +2 more sources

Toeplitz matrix-vector product based GF(2n) shifted polynomial basis multipliers for all irreducible pentanomials. [PDF]

IACR Cryptol. ePrint Arch., 2013
Besides Karatsuba algorithm, optimal Toeplitz matrix-vector product (TMVP) formulae is another approach to design GF(2^n) subquadratic multipliers.
Jiangtao Han, Haining Fan
core   +3 more sources

Fast Bit Parallel-Shifted Polynomial Basis Multipliers in GF(2n).

IEEE Trans. Circuits Syst. I Regul. Pap., 2006
Haining Fan, Masud Anwarul Hasan
openaire   +1 more source

Fast Bit Parallel-Shifted Polynomial Basis Multipliers in &lt;formula formulatype="inline"&gt;&lt;tex&gt;$GF(2^{n})$&lt;/tex&gt;&lt;/formula&gt;

IEEE Transactions on Circuits and Systems I: Regular Papers, 2006
Haining Fan, M. Anwar Hasan
openaire   +1 more source