搜索结果: 1-3 共查到“军事学 irreducible pentanomials”相关记录3条 . 查询时间(0.062 秒)
A new class of irreducible pentanomials for polynomial based multipliers in binary fields
irreducible pentanomials polynomial multiplication modular reduction
2018/6/5
We give the total cost of the multiplier and found that the bit-parallel multiplier defined by this new class of polynomials has improved XOR and AND complexity. Our multiplier has comparable time del...
$GF(2^n)$ Bit-Parallel Squarer Using Generalized Polynomial Basis For a New Class of Irreducible Pentanomials
implementation implementation
2016/1/26
We present explicit formulae and complexities of bit-parallel GF(2n) squarers for a new class of irreducible pentanomials xn+xn−1+xk+x+1, where n is odd and 1 The squarer is bas...
Toeplitz matrix-vector product based GF(2^n) shifted polynomial basis multipliers for all irreducible pentanomials
subquadratic space complexity multiplier shifted polynomial basis
2014/3/11
Besides Karatsuba algorithm, optimal Toeplitz matrix-vector product (TMVP) formulae is another approach to design GF(2^n) subquadratic multipliers. However, when GF(2^n) elements are represented using...