GF(2(n)) bit-parallel squarer using generalised polynomial basis for new class of irreducible pentanomials
GF(2(n)) bit-parallel squarer using generalised polynomial basis for new class of irreducible pentanomials
复制标题
使用广义多项式基础的 GF(2(n)) 位并行平方器用于新一类不可约五项式
DOI：
10.1049/el.2014.0006
复制
发表时间：
2014
影响因子：
1.1
通讯作者：
Fan Haining
中科院分区：
文献类型：
--
作者：
Xiong Xi;Fan Haining
Explicit formulae and complexities of bit‐parallel GF(2n) squarers for a new class of irreducible pentanomialsxn+xn−1+xk+x+ 1, wherenis odd and 1 <k< (n −1)/2 are presented. The squarer is based on the generalised polynomial basis of GF(2n). Its gate delay matches the best results, whereas its XOR gate complexity isn+ 1, which is only about two thirds of the current best results.
