GF（2m）域上快速模乘处理结构的研究与设计

An Efficient Architecture for Fast Modular Multiplication in GF(2m)

加速GF(2m)上的模乘运算是提高GF(2m)上ECC算法性能的关键。在分析EC上点乘操作的基础上,我们构造了模乘运算在线性Systolic上实现的局部并行处理递推形式,并设计了Systolic阵列的具体单元结构和连接,给出了性能分析和模拟结果。实验证明,局部并行阵列结构能适应多种EC上的模乘处理。

Speeding up the modular multiplication is the key to improving the performances of ECC algorithms in GF(2~m). After analyzing the point multiplication in EC,we educe the modular multiplication formula in GF(2~m) for the systolic implementation with partial-parallelism. We also design an efficient architecture of systolic arrays and study the performance of the array elements. Simulation results prove that the partial-parallel architecture can process modular multiplication efficiently with proper hardware cost.