可重构双基双域模乘器设计与实现

摘要

This paper selects the word-level Montgomery modular multiplication algorithm based on both prime field and binary field, and analyzes the low speed efficiency problem of traditional dual-field modular multiplier in GF (2m). This design has completed the works such as the word length with equivalent delay on the dual field, and this reconfigurable modular multiplier supported the operation on both GF{p) and Gf(2m). The results indicate that the proposed multiplier requires shorter clock cycle numbers shortened 44% in average than the others.%选择素数域和二进制域上基于字的Montgomery模乘算法,分析传统双域模乘器在二进制域上运算效率不高的问题,首先选择能够使两个域上模乘嚣延迟时间相当的字长,并对模乘器进行双域的可重构设计,使之能够同时支持素数域和二进制域上的运算.相较以往设计,采用双域双基设计的模乘器使时钟周期数平均缩短了48％.