arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.00432math.NTcs.CR
收藏

二元域上多项式乘子的一类新的不可约五项式

A new class of irreducible pentanomials for polynomial based multipliers in binary fields

Gustavo Banegas, Ricardo Custodio, Daniel Panario

摘要:

引入一类新的$\mathbb{F}_2$上的不可约五项式,其形式为$f(x) = x^{2b+c} + x^{b+c} + x^b + x^c + 1$ .设$m=2b+c$和使用$f$定义有限域扩张度$m$。我们给出了计算降模$f$所需的确切操作数。我们还提供了一个基于Karatsuba算法的乘法器在$\mathbb{F}_2[x]$结合我们的约简过程。我们给出了乘法器的总成本,并发现由这类新多项式定义的位并行乘法器具有改进的XOR和AND复杂度。与基于Karatsuba算法的其他乘法器相比,我们的乘法器具有相当的时间延迟。

英文摘要:

We introduce a new class of irreducible pentanomials over $\mathbb{F}_2$ of the form $f(x) = x^{2b+c} + x^{b+c} + x^b + x^c + 1$. Let $m=2b+c$ and use $f$ to define the finite field extension of degree $m$. We give the exact number of operations required for computing the reduction modulo $f$. We also provide a multiplier based on Karatsuba algorithm in $\mathbb{F}_2[x]$ combined with our reduction process. 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 delay when compared to other multipliers based on Karatsuba algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑