摘要
研究有限域(定义在GF(2)上的m维向量空间)的正规基乘法器。基于域元素的正规基表示和多项式基表示可以相互转换,通过分析多项式基下的乘法运算公式,得到利于串行乘法器设计的有效性质。利用该性质,提出了一个新的串行正规基乘法器,该乘法器要求(2m-2)个二值输入的异或门,m个二值输入的与门。在进行具体的硬件实现时,所需要的存储空间为3m+1。
The efficient normal basis multiplier is studied. Based on the fact that the normal basis representation of the field elements can convert to the polynomial basis representation, and vice versa, the multiplying formula is analyzed carefully, and some efficient properties for designing serial multiplier are obtained. Using these properties, a new Ⅱ-type optimal normal basis serial multiplier is proposed, which needs （2m -2） XOR gates and m AND gates. The storage space of the multiplier is 3 m ＋ 1 in hardware implementation.
出处
《系统工程与电子技术》
EI
CSCD
北大核心
2005年第8期1494-1496,共3页
Systems Engineering and Electronics
关键词
密码学
有限域
最优正规基
乘法器
复杂性
cryptography
finite field
optimal normal basis
multiplier
complexity
