Low Complexity Bit-Parallel Multiplier for a Class of Finite Fields

摘要：

This short paper summarizes our recent results on construction of low-complexity bit-parallel finite field multiplier using polynomial basis. The complexity and time delay of the proposed multipliers are lower than those of the simlar proposals.

作者: Huapeng Wu

作者单位: Dept. of Electrical and Computer Engineering University of Windsor Windsor, Ontario N9B 3P4 Canada

会议类型: 国际会议

会议名称: 2006 International Conference on Communications,Circuits and Systems(第四届国际通信、电路与系统学术会议)

会议地点: 广西桂林

会议语种:英文

页码: 2565-2568

在线出版日期: 2006-06-25（万方平台首次上网日期，不代表论文的发表时间）