GF（2m）域上Ⅱ型最优正规基的字级乘法器

A word-level multiplier using optimal normal basis type Ⅱ over GF（2m）

通过研究Ⅱ型最优正规基及重序正规基之间的关系及特点,提出了一种GF(2m)域上Ⅱ型最优正规基字级乘法器。该型乘法器比串行结构乘法器更快速,比并行结构乘法器更节省资源;算法针对字级结构进行了最优,相比其他字级结构乘法器具有更小的空间复杂度。实验表明,该乘法器可以获得很高的时钟频率,且不受运算字长的影响。

In this paper,based on the research of optimal normal basis type Ⅱ and reordered normal basis,a high-speed architectures for GF（2m） field multiplication using reordered normal basis are proposed.Complexity comparison shows that the proposed architectures are faster compared to previously presented architectures.One advantage of the new word-level architectures is that the critical path delay is a constan.This enables the multipliers to operate at very high clock rates regardless of the field size or the number of words.